Training and deploying pose regressions in neural networks in autonomous machines

ABSTRACT

A mechanism is described for facilitating training and deploying of pose regression in neural networks in autonomous machines. A method, as described herein, includes facilitating capturing, by an image capturing device of a computing device, one or more images of one or more objects, where the one or more images include one or more training images associated with a neural network. The method may further include continuously estimating, in real-time, a present orientation of the computing device, where estimating includes continuously detecting a real-time view field as viewed by the image capturing device and based on the one or more images. The method may further include applying pose regression relating to the image capturing device using the real-time view field.

FIELD

Embodiments described herein generally relate to computers. More particularly, embodiments are described for facilitating training and deploying of pose regressions in neural networks in autonomous machines.

BACKGROUND

Convolutional Neural Networks (“CNNs” or “ConvNets”) have achieved high level of efficiency and results in computer vision and other adjacent tasks. For example CNN might be used to regress a pose from a raw image data in an environment in order to help solve on key pain points in robot simultaneous localization and mapping (SLAM) issues and other such problems. Further, for example, a computing device's camera pose or a robot's eye pose includes certain basic information, such as translation and rotation, where a translation label is regarded as somewhat straight forward relating to global coordinates in the environment, a rotation table is regarded as fairly complex. Conventional techniques are known for using quaternions as rotation labels in their training methods; however, quaternions are fundamentally flawed, resulting in severe drawbacks and additional problems.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings in which like reference numerals refer to similar elements.

FIG. 1 is a block diagram of a processing system, according to an embodiment.

FIG. 2 is a block diagram of an embodiment of a processor having one or more processor cores, an integrated memory controller, and an integrated graphics processor.

FIG. 3 is a block diagram of a graphics processor, which may be a discrete graphics processing unit, or may be a graphics processor integrated with a plurality of processing cores.

FIG. 4 is a block diagram of a graphics processing engine of a graphics processor in accordance with some embodiments.

FIG. 5 is a block diagram of another embodiment of a graphics processor.

FIG. 6 illustrates thread execution logic including an array of processing elements employed in some embodiments of a graphics processing engine.

FIG. 7 is a block diagram illustrating a graphics processor instruction formats according to some embodiments.

FIG. 8 is a block diagram of another embodiment of a graphics processor.

FIG. 9A is a block diagram illustrating a graphics processor command format according to an embodiment.

FIG. 9B is a block diagram illustrating a graphics processor command sequence according to an embodiment.

FIG. 10 illustrates exemplary graphics software architecture for a data processing system according to some embodiments.

FIG. 11 is a block diagram illustrating an IP core development system that may be used to manufacture an integrated circuit to perform operations according to an embodiment.

FIG. 12 is a block diagram illustrating an exemplary system on a chip integrated circuit that may be fabricated using one or more IP cores, according to an embodiment.

FIG. 13 is a block diagram illustrating an exemplary graphics processor of a system on a chip integrated circuit that may be fabricated using one or more IP cores, according to an embodiment.

FIG. 14 is a block diagram illustrating an additional exemplary graphics processor of a system on a chip integrated circuit that may be fabricated using one or more IP cores, according to an embodiment.

FIG. 15 illustrates a computing device employing a pose regression mechanism according to one embodiment.

FIG. 16 illustrates a pose regression mechanism according to one embodiment.

FIG. 17 illustrates a girdle of a field of view associated with an autonomous machine (e.g., robot) according to one embodiment.

FIG. 18A illustrates a conventional neural network model using quaternion.

FIG. 18B illustrates a conventional neural network model using quaternion.

FIG. 18C illustrates a neural network model using a decomposed six-dimensional angle as facilitated by the pose regression mechanism of FIG. 15 according to one embodiment.

FIG. 18D illustrates a neural network model using a decomposed six-dimensional angle as facilitated by the pose regression mechanism of FIG. 15 according to one embodiment.

FIG. 18E illustrates a neural network model using a decomposed six-dimensional angle as facilitated by the pose regression mechanism of FIG. 15 according to one embodiment.

FIG. 19A illustrates a conventional transaction sequence using quaternion.

FIG. 19B illustrates a transaction sequence using a decomposed angle estimator as facilitated by the pose regression mechanism of FIG. 15 according to one embodiment.

FIG. 19C illustrates a transaction sequence using a decomposed angle estimator as facilitated by the pose regression mechanism of FIG. 15 according to one embodiment.

FIG. 19D illustrates a transaction sequence using a decomposed angle estimator as facilitated by the pose regression mechanism of FIG. 15 according to one embodiment.

FIGS. 20A, 20B, and 20C illustrate a table and two graphs indicating a decomposed angle being superior to a quaternion according to one embodiment.

FIGS. 20D, 20E, and 20F illustrate a table and two graphs indicating a decomposed angle being superior to a quaternion according to one embodiment.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth. However, embodiments, as described herein, may be practiced without these specific details. In other instances, well-known circuits, structures and techniques have not been shown in details in order not to obscure the understanding of this description.

Embodiments provide for a novel technique for employing and use a decomposed angle estimator to train and deploy pose regression in neural networks (NNs), such as CNN. A neural network refers to artificial neural networks (ANNs), such as a CNN, that is inspired by and generally based on biological neural networks (BNN), such as central nervous systems in humans and animals. It is contemplated that decomposed angle estimator may be referred to as “decomposed angle”, “decomposed estimator”, “angle estimator”, “decomposed 4D angle”, “Euler4”, “decomposed 6D angle”, “Euler 6”. “decomposed angle estimation and prediction logic”, and “estimation and prediction logic”.

Although there are several conventional techniques relating to rotation representing methods, such as quaternion, matrix, Euler angle, etc., they are not equally performed in pose regression tasks. In one embodiment, a novel and innovative representing method is provided through a decomposed estimator that is distinct from a classic Euler angle and performs far more efficiently and accurately than any of the convention techniques based on quaternion, matrix. Euler angle, etc.

Euler angles are well-known in describing orientation of a rigid body, such as by taking into account a three-dimensional (3D) Euclidean space where three parameters are used. Embodiments provide for a novel technique for employing and considering a distinct sort of an angle, such as a novel and innovative decomposed angle estimator that is smart enough to consider 4 dimensions (as opposed to 3 dimensions offered by the classic Euler angle), offering added efficiency and accuracy in training and deploying pose regression in neural networks.

It is contemplated that terms like “request”, “query”, “job”, “work”, “work item”, and “workload” may be referenced interchangeably throughout this document. Similarly, an “application” or “agent” may refer to or include a computer program, a software application, a game, a workstation application, etc., offered through an application programming interface (API), such as a free rendering API, such as Open Graphics Library (OpenGL®), DirectX® 11, DirectX® 12, etc., where “dispatch” may be interchangeably referred to as “work unit” or “draw” and similarly, “application” may be interchangeably referred to as “workflow” or simply “agent”. For example, a workload, such as that of a three-dimensional (3D) game, may include and issue any number and type of “frames” where each frame may represent an image (e.g., sailboat, human face). Further, each frame may include and offer any number and type of work units, where each work unit may represent a part (e.g., mast of sailboat, forehead of human face) of the image (e.g., sailboat, human face) represented by its corresponding frame. However, for the sake of consistency, each item may be referenced by a single term (e.g., “dispatch”, “agent”, etc.) throughout this document.

In some embodiments, terms like “display screen” and “display surface” may be used interchangeably referring to the visible portion of a display device while the rest of the display device may be embedded into a computing device, such as a smartphone, a wearable device, etc. It is contemplated and to be noted that embodiments are not limited to any particular computing device, software application, hardware component, display device, display screen or surface, protocol, standard, etc. For example, embodiments may be applied to and used with any number and type of real-time applications on any number and type of computers, such as desktops, laptops, tablet computers, smartphones, head-mounted displays and other wearable devices, and/or the like. Further, for example, rendering scenarios for efficient performance using this novel technique may range from simple scenarios, such as desktop compositing, to complex scenarios, such as 3D games, augmented reality applications, etc.

System Overview

FIG. 1 is a block diagram of a processing system 100, according to an embodiment. In various embodiments the system 100 includes one or more processors 102 and one or more graphics processors 108, and may be a single processor desktop system, a multiprocessor workstation system, or a server system having a large number of processors 102 or processor cores 107. In one embodiment, the system 100 is a processing platform incorporated within a system-on-a-chip (SoC) integrated circuit for use in mobile, handheld, or embedded devices.

An embodiment of system 100 can include, or be incorporated within a server-based gaming platform, a game console, including a game and media console, a mobile gaming console, a handheld game console, or an online game console. In some embodiments system 100 is a mobile phone, smart phone, tablet computing device or mobile Internet device. Data processing system 100 can also include, couple with, or be integrated within a wearable device, such as a smart watch wearable device, smart eyewear device, augmented reality device, or virtual reality device. In some embodiments, data processing system 100 is a television or set top box device having one or more processors 102 and a graphical interface generated by one or more graphics processors 108.

In some embodiments, the one or more processors 102 each include one or more processor cores 107 to process instructions which, when executed, perform operations for system and user software. In some embodiments, each of the one or more processor cores 107 is configured to process a specific instruction set 109. In some embodiments, instruction set 109 may facilitate Complex Instruction Set Computing (CISC), Reduced Instruction Set Computing (RISC), or computing via a Very Long Instruction Word (VLIW). Multiple processor cores 107 may each process a different instruction set 109, which may include instructions to facilitate the emulation of other instruction sets. Processor core 107 may also include other processing devices, such a Digital Signal Processor (DSP).

In some embodiments, the processor 102 includes cache memory 104. Depending on the architecture, the processor 102 can have a single internal cache or multiple levels of internal cache. In some embodiments, the cache memory is shared among various components of the processor 102. In some embodiments, the processor 102 also uses an external cache (e.g., a Level-3 (L3) cache or Last Level Cache (LLC)) (not shown), which may be shared among processor cores 107 using known cache coherency techniques. A register file 106 is additionally included in processor 102 which may include different types of registers for storing different types of data (e.g., integer registers, floating point registers, status registers, and an instruction pointer register). Some registers may be general-purpose registers, while other registers may be specific to the design of the processor 102.

In some embodiments, processor 102 is coupled with a processor bus 110 to transmit communication signals such as address, data, or control signals between processor 102 and other components in system 100. In one embodiment the system 100 uses an exemplary ‘hub’ system architecture, including a memory controller hub 116 and an Input Output (I/O) controller hub 130. A memory controller hub 116 facilitates communication between a memory device and other components of system 100, while an I/O Controller Hub (ICH) 130 provides connections to I/O devices via a local I/O bus. In one embodiment, the logic of the memory controller hub 116 is integrated within the processor.

Memory device 120 can be a dynamic random access memory (DRAM) device, a static random access memory (SRAM) device, flash memory device, phase-change memory device, or some other memory device having suitable performance to serve as process memory. In one embodiment the memory device 120 can operate as system memory for the system 100, to store data 122 and instructions 121 for use when the one or more processors 102 executes an application or process. Memory controller hub 116 also couples with an optional external graphics processor 112, which may communicate with the one or more graphics processors 108 in processors 102 to perform graphics and media operations.

In some embodiments, ICH 130 enables peripherals to connect to memory device 120 and processor 102 via a high-speed I/O bus. The I/O peripherals include, but are not limited to, an audio controller 146, a firmware interface 128, a wireless transceiver 126 (e.g., Wi-Fi, Bluetooth), a data storage device 124 (e.g., hard disk drive, flash memory, etc.), and a legacy I/O controller 140 for coupling legacy (e.g., Personal System 2 (PS/2)) devices to the system. One or more Universal Serial Bus (USB) controllers 142 connect input devices, such as keyboard and mouse 144 combinations. A network controller 134 may also couple with ICH 130. In some embodiments, a high-performance network controller (not shown) couples with processor bus 110. It will be appreciated that the system 100 shown is exemplary and not limiting, as other types of data processing systems that are differently configured may also be used. For example, the I/O controller hub 130 may be integrated within the one or more processor 102, or the memory controller hub 116 and I/O controller hub 130 may be integrated into a discreet external graphics processor, such as the external graphics processor 112.

FIG. 2 is a block diagram of an embodiment of a processor 200 having one or more processor cores 202A-202N, an integrated memory controller 214, and an integrated graphics processor 208. Those elements of FIG. 2 having the same reference numbers (or names) as the elements of any other figure herein can operate or function in any manner similar to that described elsewhere herein, but are not limited to such. Processor 200 can include additional cores up to and including additional core 202N represented by the dashed lined boxes. Each of processor cores 202A-202N includes one or more internal cache units 204A-204N. In some embodiments each processor core also has access to one or more shared cached units 206.

The internal cache units 204A-204N and shared cache units 206 represent a cache memory hierarchy within the processor 200. The cache memory hierarchy may include at least one level of instruction and data cache within each processor core and one or more levels of shared mid-level cache, such as a Level 2 (L2), Level 3 (L3), Level 4 (L4), or other levels of cache, where the highest level of cache before external memory is classified as the LLC. In some embodiments, cache coherency logic maintains coherency between the various cache units 206 and 204A-204N.

In some embodiments, processor 200 may also include a set of one or more bus controller units 216 and a system agent core 210. The one or more bus controller units 216 manage a set of peripheral buses, such as one or more Peripheral Component Interconnect buses (e.g., PCI, PCI Express). System agent core 210 provides management functionality for the various processor components. In some embodiments, system agent core 210 includes one or more integrated memory controllers 214 to manage access to various external memory devices (not shown).

In some embodiments, one or more of the processor cores 202A-202N include support for simultaneous multi-threading. In such embodiment, the system agent core 210 includes components for coordinating and operating cores 202A-202N during multi-threaded processing. System agent core 210 may additionally include a power control unit (PCU), which includes logic and components to regulate the power state of processor cores 202A-202N and graphics processor 208.

In some embodiments, processor 200 additionally includes graphics processor 208 to execute graphics processing operations. In some embodiments, the graphics processor 208 couples with the set of shared cache units 206, and the system agent core 210, including the one or more integrated memory controllers 214. In some embodiments, a display controller 211 is coupled with the graphics processor 208 to drive graphics processor output to one or more coupled displays. In some embodiments, display controller 211 may be a separate module coupled with the graphics processor via at least one interconnect, or may be integrated within the graphics processor 208 or system agent core 210.

In some embodiments, a ring based interconnect unit 212 is used to couple the internal components of the processor 200. However, an alternative interconnect unit may be used, such as a point-to-point interconnect, a switched interconnect, or other techniques, including techniques well known in the art. In some embodiments, graphics processor 208 couples with the ring interconnect 212 via an I/O link 213.

The exemplary I/O link 213 represents at least one of multiple varieties of I/O interconnects, including an on package 1/O interconnect which facilitates communication between various processor components and a high-performance embedded memory module 218, such as an eDRAM module. In some embodiments, each of the processor cores 202A-202N and graphics processor 208 use embedded memory modules 218 as a shared Last Level Cache.

In some embodiments, processor cores 202A-202N are homogenous cores executing the same instruction set architecture. In another embodiment, processor cores 202A-202N are heterogeneous in terms of instruction set architecture (ISA), where one or more of processor cores 202A-202N execute a first instruction set, while at least one of the other cores executes a subset of the first instruction set or a different instruction set. In one embodiment processor cores 202A-202N are heterogeneous in terms of microarchitecture, where one or more cores having a relatively higher power consumption couple with one or more power cores having a lower power consumption. Additionally, processor 200 can be implemented on one or more chips or as an SoC integrated circuit having the illustrated components, in addition to other components.

FIG. 3 is a block diagram of a graphics processor 300, which may be a discrete graphics processing unit, or may be a graphics processor integrated with a plurality of processing cores. In some embodiments, the graphics processor communicates via a memory mapped I/O interface to registers on the graphics processor and with commands placed into the processor memory. In some embodiments, graphics processor 300 includes a memory interface 314 to access memory. Memory interface 314 can be an interface to local memory, one or more internal caches, one or more shared external caches, and/or to system memory.

In some embodiments, graphics processor 300 also includes a display controller 302 to drive display output data to a display device 320. Display controller 302 includes hardware for one or more overlay planes for the display and composition of multiple layers of video or user interface elements. In some embodiments, graphics processor 300 includes a video codec engine 306 to encode, decode, or transcode media to, from, or between one or more media encoding formats, including, but not limited to Moving Picture Experts Group (MPEG) formats such as MPEG-2, Advanced Video Coding (AVC) formats such as H.264/MPEG-4 AVC, as well as the Society of Motion Picture & Television Engineers (SMPTE) 421M/VC-1, and Joint Photographic Experts Group (JPEG) formats such as JPEG, and Motion JPEG (MJPEG) formats.

In some embodiments, graphics processor 300 includes a block image transfer (BLIT) engine 304 to perform two-dimensional (2D) rasterizer operations including, for example, bit-boundary block transfers. However, in one embodiment, 2D graphics operations are performed using one or more components of graphics processing engine (GPE) 310. In some embodiments. GPE 310 is a compute engine for performing graphics operations, including three-dimensional (3D) graphics operations and media operations.

In some embodiments, GPE 310 includes a 3D pipeline 312 for performing 3D operations, such as rendering three-dimensional images and scenes using processing functions that act upon 3D primitive shapes (e.g., rectangle, triangle, etc.). The 3D pipeline 312 includes programmable and fixed function elements that perform various tasks within the element and/or spawn execution threads to a 3D/Media sub-system 315. While 3D pipeline 312 can be used to perform media operations, an embodiment of GPE 310 also includes a media pipeline 316 that is specifically used to perform media operations, such as video post-processing and image enhancement.

In some embodiments, media pipeline 316 includes fixed function or programmable logic units to perform one or more specialized media operations, such as video decode acceleration, video de-interlacing, and video encode acceleration in place of, or on behalf of video codec engine 306. In some embodiments, media pipeline 316 additionally includes a thread spawning unit to spawn threads for execution on 3D/Media sub-system 315. The spawned threads perform computations for the media operations on one or more graphics execution units included in 3D/Media sub-system 315.

In some embodiments, 3D/Media subsystem 315 includes logic for executing threads spawned by 3D pipeline 312 and media pipeline 316. In one embodiment, the pipelines send thread execution requests to 3D/Media subsystem 315, which includes thread dispatch logic for arbitrating and dispatching the various requests to available thread execution resources. The execution resources include an array of graphics execution units to process the 3D and media threads. In some embodiments, 3D/Media subsystem 315 includes one or more internal caches for thread instructions and data. In some embodiments, the subsystem also includes shared memory, including registers and addressable memory, to share data between threads and to store output data.

Graphics Processing Engine

FIG. 4 is a block diagram of a graphics processing engine 410 of a graphics processor in accordance with some embodiments. In one embodiment, the graphics processing engine (GPE) 410 is a version of the GPE 310 shown in FIG. 3. Elements of FIG. 4 having the same reference numbers (or names) as the elements of any other figure herein can operate or function in any manner similar to that described elsewhere herein, but are not limited to such. For example, the 3D pipeline 312 and media pipeline 316 of FIG. 3 are illustrated. The media pipeline 316 is optional in some embodiments of the GPE 410 and may not be explicitly included within the GPE 410. For example and in at least one embodiment, a separate media and/or image processor is coupled to the GPE 410.

In some embodiments, GPE 410 couples with or includes a command streamer 403, which provides a command stream to the 3D pipeline 312 and/or media pipelines 316. In some embodiments, command streamer 403 is coupled with memory, which can be system memory, or one or more of internal cache memory and shared cache memory. In some embodiments, command streamer 403 receives commands from the memory and sends the commands to 3D pipeline 312 and/or media pipeline 316. The commands are directives fetched from a ring buffer, which stores commands for the 3D pipeline 312 and media pipeline 316. In one embodiment, the ring buffer can additionally include batch command buffers storing batches of multiple commands. The commands for the 3D pipeline 312 can also include references to data stored in memory, such as but not limited to vertex and geometry data for the 3D pipeline 312 and/or image data and memory objects for the media pipeline 316. The 3D pipeline 312 and media pipeline 316 process the commands and data by performing operations via logic within the respective pipelines or by dispatching one or more execution threads to a graphics core array 414.

In various embodiments the 3D pipeline 312 can execute one or more shader programs, such as vertex shaders, geometry shaders, pixel shaders, fragment shaders, compute shaders, or other shader programs, by processing the instructions and dispatching execution threads to the graphics core array 414. The graphics core array 414 provides a unified block of execution resources. Multi-purpose execution logic (e.g., execution units) within the graphic core array 414 includes support for various 3D API shader languages and can execute multiple simultaneous execution threads associated with multiple shaders.

In some embodiments the graphics core array 414 also includes execution logic to perform media functions, such as video and/or image processing. In one embodiment, the execution units additionally include general-purpose logic that is programmable to perform parallel general purpose computational operations, in addition to graphics processing operations. The general purpose logic can perform processing operations in parallel or in conjunction with general purpose logic within the processor core(s) 107 of FIG. 1 or core 202A-202N as in FIG. 2.

Output data generated by threads executing on the graphics core array 414 can output data to memory in a unified return buffer (URB) 418. The URB 418 can store data for multiple threads. In some embodiments the URB 418 may be used to send data between different threads executing on the graphics core array 414. In some embodiments the URB 418 may additionally be used for synchronization between threads on the graphics core array and fixed function logic within the shared function logic 420.

In some embodiments, graphics core array 414 is scalable, such that the array includes a variable number of graphics cores, each having a variable number of execution units based on the target power and performance level of GPE 410. In one embodiment the execution resources are dynamically scalable, such that execution resources may be enabled or disabled as needed.

The graphics core array 414 couples with shared function logic 420 that includes multiple resources that are shared between the graphics cores in the graphics core array. The shared functions within the shared function logic 420 are hardware logic units that provide specialized supplemental functionality to the graphics core array 414. In various embodiments, shared function logic 420 includes but is not limited to sampler 421, math 422, and inter-thread communication (ITC) 423 logic. Additionally, some embodiments implement one or more cache(s) 425 within the shared function logic 420. A shared function is implemented where the demand for a given specialized function is insufficient for inclusion within the graphics core array 414. Instead a single instantiation of that specialized function is implemented as a stand-alone entity in the shared function logic 420 and shared among the execution resources within the graphics core array 414. The precise set of functions that are shared between the graphics core array 414 and included within the graphics core array 414 varies between embodiments.

FIG. 5 is a block diagram of another embodiment of a graphics processor 500. Elements of FIG. 5 having the same reference numbers (or names) as the elements of any other figure herein can operate or function in any manner similar to that described elsewhere herein, but are not limited to such.

In some embodiments, graphics processor 500 includes a ring interconnect 502, a pipeline front-end 504, a media engine 537, and graphics cores 580A-580N. In some embodiments, ring interconnect 502 couples the graphics processor to other processing units, including other graphics processors or one or more general-purpose processor cores. In some embodiments, the graphics processor is one of many processors integrated within a multi-core processing system.

In some embodiments, graphics processor 500 receives batches of commands via ring interconnect 502. The incoming commands are interpreted by a command streamer 503 in the pipeline front-end 504. In some embodiments, graphics processor 500 includes scalable execution logic to perform 3D geometry processing and media processing via the graphics core(s) 580A-580N. For 3D geometry processing commands, command streamer 503 supplies commands to geometry pipeline 536. For at least some media processing commands, command streamer 503 supplies the commands to a video front end 534, which couples with a media engine 537. In some embodiments, media engine 537 includes a Video Quality Engine (VQE) 530 for video and image post-processing and a multi-format encode/decode (MFX) 533 engine to provide hardware-accelerated media data encode and decode. In some embodiments, geometry pipeline 536 and media engine 537 each generate execution threads for the thread execution resources provided by at least one graphics core 580A.

In some embodiments, graphics processor 500 includes scalable thread execution resources featuring modular cores 580A-580N (sometimes referred to as core slices), each having multiple sub-cores 550A-550N, 560A-560N (sometimes referred to as core sub-slices). In some embodiments, graphics processor 500 can have any number of graphics cores 580A through 580N. In some embodiments, graphics processor 500 includes a graphics core 580A having at least a first sub-core 550A and a second sub-core 560A. In other embodiments, the graphics processor is a low power processor with a single sub-core (e.g., 550A). In some embodiments, graphics processor 500 includes multiple graphics cores 580A-580N, each including a set of first sub-cores 550A-550N and a set of second sub-cores 560A-560N. Each sub-core in the set of first sub-cores 550A-550N includes at least a first set of execution units 552A-552N and media/texture samplers 554A-554N. Each sub-core in the set of second sub-cores 560A-560N includes at least a second set of execution units 562A-562N and samplers 564A-564N. In some embodiments, each sub-core 550A-550N, 560A-560N shares a set of shared resources 570A-570N. In some embodiments, the shared resources include shared cache memory and pixel operation logic. Other shared resources may also be included in the various embodiments of the graphics processor.

Execution Units

FIG. 6 illustrates thread execution logic 600 including an array of processing elements employed in some embodiments of a GPE. Elements of FIG. 6 having the same reference numbers (or names) as the elements of any other figure herein can operate or function in any manner similar to that described elsewhere herein, but are not limited to such.

In some embodiments, thread execution logic 600 includes a shader processor 602, a thread dispatcher 604, instruction cache 606, a scalable execution unit array including a plurality of execution units 608A-608N, a sampler 610, a data cache 612, and a data port 614. In one embodiment the scalable execution unit array can dynamically scale by enabling or disabling one or more execution units (e.g., any of execution unit 608A, 608B, 608C, 608D, through 608N-1 and 608N) based on the computational requirements of a workload. In one embodiment the included components are interconnected via an interconnect fabric that links to each of the components. In some embodiments, thread execution logic 600 includes one or more connections to memory, such as system memory or cache memory, through one or more of instruction cache 606, data port 614, sampler 610, and execution units 608A-608N. In some embodiments, each execution unit (e.g. 608A) is a stand-alone programmable general purpose computational unit that is capable of executing multiple simultaneous hardware threads while processing multiple data elements in parallel for each thread. In various embodiments, the array of execution units 608A-608N is scalable to include any number individual execution units.

In some embodiments, the execution units 608A-608N are primarily used to execute shader programs. A shader processor 602 can process the various shader programs and dispatch execution threads associated with the shader programs via a thread dispatcher 604. In one embodiment the thread dispatcher includes logic to arbitrate thread initiation requests from the graphics and media pipelines and instantiate the requested threads on one or more execution unit in the execution units 608A-608N. For example, the geometry pipeline (e.g., 536 of FIG. 5) can dispatch vertex, tessellation, or geometry shaders to the thread execution logic 600 (FIG. 6) for processing. In some embodiments, thread dispatcher 604 can also process runtime thread spawning requests from the executing shader programs.

In some embodiments, the execution units 608A-608N support an instruction set that includes native support for many standard 3D graphics shader instructions, such that shader programs from graphics libraries (e.g., Direct 3D and OpenGL) are executed with a minimal translation. The execution units support vertex and geometry processing (e.g., vertex programs, geometry programs, vertex shaders), pixel processing (e.g., pixel shaders, fragment shaders) and general-purpose processing (e.g., compute and media shaders). Each of the execution units 608A-608N is capable of multi-issue single instruction multiple data (SIMD) execution and multi-threaded operation enables an efficient execution environment in the face of higher latency memory accesses. Each hardware thread within each execution unit has a dedicated high-bandwidth register file and associated independent thread-state. Execution is multi-issue per clock to pipelines capable of integer, single and double precision floating point operations, SIMD branch capability, logical operations, transcendental operations, and other miscellaneous operations. While waiting for data from memory or one of the shared functions, dependency logic within the execution units 608A-608N causes a waiting thread to sleep until the requested data has been returned. While the waiting thread is sleeping, hardware resources may be devoted to processing other threads. For example, during a delay associated with a vertex shader operation, an execution unit can perform operations for a pixel shader, fragment shader, or another type of shader program, including a different vertex shader.

Each execution unit in execution units 608A-608N operates on arrays of data elements. The number of data elements is the “execution size,” or the number of channels for the instruction. An execution channel is a logical unit of execution for data element access, masking, and flow control within instructions. The number of channels may be independent of the number of physical Arithmetic Logic Units (ALUs) or Floating Point Units (FPUs) for a particular graphics processor. In some embodiments, execution units 608A-608N support integer and floating-point data types.

The execution unit instruction set includes SIMD instructions. The various data elements can be stored as a packed data type in a register and the execution unit will process the various elements based on the data size of the elements. For example, when operating on a 256-bit wide vector, the 256 bits of the vector are stored in a register and the execution unit operates on the vector as four separate 64-bit packed data elements (Quad-Word (QW) size data elements), eight separate 32-bit packed data elements (Double Word (DW) size data elements), sixteen separate 16-bit packed data elements (Word (W) size data elements), or thirty-two separate 8-bit data elements (byte (B) size data elements). However, different vector widths and register sizes are possible.

One or more internal instruction caches (e.g., 606) are included in the thread execution logic 600 to cache thread instructions for the execution units. In some embodiments, one or more data caches (e.g., 612) are included to cache thread data during thread execution. In some embodiments, a sampler 610 is included to provide texture sampling for 3D operations and media sampling for media operations. In some embodiments, sampler 610 includes specialized texture or media sampling functionality to process texture or media data during the sampling process before providing the sampled data to an execution unit.

During execution, the graphics and media pipelines send thread initiation requests to thread execution logic 600 via thread spawning and dispatch logic. Once a group of geometric objects has been processed and rasterized into pixel data, pixel processor logic (e.g., pixel shader logic, fragment shader logic, etc.) within the shader processor 602 is invoked to further compute output information and cause results to be written to output surfaces (e.g., color buffers, depth buffers, stencil buffers, etc.). In some embodiments, a pixel shader or fragment shader calculates the values of the various vertex attributes that are to be interpolated across the rasterized object. In some embodiments, pixel processor logic within the shader processor 602 then executes an application programming interface (API)-supplied pixel or fragment shader program. To execute the shader program, the shader processor 602 dispatches threads to an execution unit (e.g., 608A) via thread dispatcher 604. In some embodiments, pixel shader 602 uses texture sampling logic in the sampler 610 to access texture data in texture maps stored in memory. Arithmetic operations on the texture data and the input geometry data compute pixel color data for each geometric fragment, or discards one or more pixels from further processing.

In some embodiments, the data port 614 provides a memory access mechanism for the thread execution logic 600 output processed data to memory for processing on a graphics processor output pipeline. In some embodiments, the data port 614 includes or couples to one or more cache memories (e.g., data cache 612) to cache data for memory access via the data port.

FIG. 7 is a block diagram illustrating a graphics processor instruction formats 700 according to some embodiments. In one or more embodiment, the graphics processor execution units support an instruction set having instructions in multiple formats. The solid lined boxes illustrate the components that are generally included in an execution unit instruction, while the dashed lines include components that are optional or that are only included in a sub-set of the instructions. In some embodiments, instruction format 700 described and illustrated are macro-instructions, in that they are instructions supplied to the execution unit, as opposed to micro-operations resulting from instruction decode once the instruction is processed.

In some embodiments, the graphics processor execution units natively support instructions in a 128-bit instruction format 710. A 64-bit compacted instruction format 730 is available for some instructions based on the selected instruction, instruction options, and number of operands. The native 128-bit instruction format 710 provides access to all instruction options, while some options and operations are restricted in the 64-bit format 730. The native instructions available in the 64-bit format 730 vary by embodiment. In some embodiments, the instruction is compacted in part using a set of index values in an index field 713. The execution unit hardware references a set of compaction tables based on the index values and uses the compaction table outputs to reconstruct a native instruction in the 128-bit instruction format 710.

For each format, instruction opcode 712 defines the operation that the execution unit is to perform. The execution units execute each instruction in parallel across the multiple data elements of each operand. For example, in response to an add instruction the execution unit performs a simultaneous add operation across each color channel representing a texture element or picture element. By default, the execution unit performs each instruction across all data channels of the operands. In some embodiments, instruction control field 714 enables control over certain execution options, such as channels selection (e.g., predication) and data channel order (e.g., swizzle). For instructions in the 128-bit instruction format 710 an exec-size field 716 limits the number of data channels that will be executed in parallel. In some embodiments, exec-size field 716 is not available for use in the 64-bit compact instruction format 730.

Some execution unit instructions have up to three operands including two source operands, src0 720, src1 722, and one destination 718. In some embodiments, the execution units support dual destination instructions, where one of the destinations is implied. Data manipulation instructions can have a third source operand (e.g., SRC2 724), where the instruction opcode 712 determines the number of source operands. An instruction's last source operand can be an immediate (e.g., hard-coded) value passed with the instruction.

In some embodiments, the 128-bit instruction format 710 includes an access/address mode field 726 specifying, for example, whether direct register addressing mode or indirect register addressing mode is used. When direct register addressing mode is used, the register address of one or more operands is directly provided by bits in the instruction.

In some embodiments, the 128-bit instruction format 710 includes an access/address mode field 726, which specifies an address mode and/or an access mode for the instruction. In one embodiment the access mode is used to define a data access alignment for the instruction. Some embodiments support access modes including a 16-byte aligned access mode and a 1-byte aligned access mode, where the byte alignment of the access mode determines the access alignment of the instruction operands. For example, when in a first mode, the instruction may use byte-aligned addressing for source and destination operands and when in a second mode, the instruction may use 16-byte-aligned addressing for all source and destination operands.

In one embodiment, the address mode portion of the access/address mode field 726 determines whether the instruction is to use direct or indirect addressing. When direct register addressing mode is used bits in the instruction directly provide the register address of one or more operands. When indirect register addressing mode is used, the register address of one or more operands may be computed based on an address register value and an address immediate field in the instruction.

In some embodiments instructions are grouped based on opcode 712 bit-fields to simplify Opcode decode 740. For an 8-bit opcode, bits 4, 5, and 6 allow the execution unit to determine the type of opcode. The precise opcode grouping shown is merely an example. In some embodiments, a move and logic opcode group 742 includes data movement and logic instructions (e.g., move (mov), compare (cmp)). In some embodiments, move and logic group 742 shares the five most significant bits (MSB), where move (mov) instructions are in the form of 0000xxxxb and logic instructions are in the form of 0001xxxxb. A flow control instruction group 744 (e.g., call, jump (jmp)) includes instructions in the form of 0010xxxxb (e.g., 0x20). A miscellaneous instruction group 746 includes a mix of instructions, including synchronization instructions (e.g., wait, send) in the form of 0011xxxxb (e.g., 0x30). A parallel math instruction group 748 includes component-wise arithmetic instructions (e.g., add, multiply (mul)) in the form of 0100xxxxb (e.g., 0x40). The parallel math group 748 performs the arithmetic operations in parallel across data channels. The vector math group 750 includes arithmetic instructions (e.g., dp4) in the form of 0101xxxxb (e.g., 0x50). The vector math group performs arithmetic such as dot product calculations on vector operands.

Graphics Pipeline

FIG. 8 is a block diagram of another embodiment of a graphics processor 800. Elements of FIG. 8 having the same reference numbers (or names) as the elements of any other figure herein can operate or function in any manner similar to that described elsewhere herein, but are not limited to such.

In some embodiments, graphics processor 800 includes a graphics pipeline 820, a media pipeline 830, a display engine 840, thread execution logic 850, and a render output pipeline 870.

In some embodiments, graphics processor 800 is a graphics processor within a multi-core processing system that includes one or more general purpose processing cores. The graphics processor is controlled by register writes to one or more control registers (not shown) or via commands issued to graphics processor 800 via a ring interconnect 802. In some embodiments, ring interconnect 802 couples graphics processor 800 to other processing components, such as other graphics processors or general-purpose processors. Commands from ring interconnect 802 are interpreted by a command streamer 803, which supplies instructions to individual components of graphics pipeline 820 or media pipeline 830.

In some embodiments, command streamer 803 directs the operation of a vertex fetcher 805 that reads vertex data from memory and executes vertex-processing commands provided by command streamer 803. In some embodiments, vertex fetcher 805 provides vertex data to a vertex shader 807, which performs coordinate space transformation and lighting operations to each vertex. In some embodiments, vertex fetcher 805 and vertex shader 807 execute vertex-processing instructions by dispatching execution threads to execution units 852A-852B via a thread dispatcher 831.

In some embodiments, execution units 852A-852B are an array of vector processors having an instruction set for performing graphics and media operations. In some embodiments, execution units 852A-852B have an attached L1 cache 851 that is specific for each array or shared between the arrays. The cache can be configured as a data cache, an instruction cache, or a single cache that is partitioned to contain data and instructions in different partitions.

In some embodiments, graphics pipeline 820 includes tessellation components to perform hardware-accelerated tessellation of 3D objects. In some embodiments, a programmable hull shader 811 configures the tessellation operations. A programmable domain shader 817 provides back-end evaluation of tessellation output, where tessellator 813 operates at the direction of hull shader 811 and contains special purpose logic to generate a set of detailed geometric objects based on a coarse geometric model that is provided as input to graphics pipeline 820. In some embodiments, if tessellation is not used, tessellation components (e.g., hull shader 811, tessellator 813, and domain shader 817) can be bypassed.

In some embodiments, complete geometric objects can be processed by a geometry shader 819 via one or more threads dispatched to execution units 852A-852B, or can proceed directly to the clipper 829. In some embodiments, the geometry shader operates on entire geometric objects, rather than vertices or patches of vertices as in previous stages of the graphics pipeline. If the tessellation is disabled the geometry shader 819 receives input from the vertex shader 807. In some embodiments, geometry shader 819 is programmable by a geometry shader program to perform geometry tessellation if the tessellation units are disabled.

Before rasterization, a clipper 829 processes vertex data. The clipper 829 may be a fixed function clipper or a programmable clipper having clipping and geometry shader functions. In some embodiments, a rasterizer and depth test component 873 in the render output pipeline 870 dispatches pixel shaders to convert the geometric objects into their per pixel representations. In some embodiments, pixel shader logic is included in thread execution logic 850. In some embodiments, an application can bypass the rasterizer and depth test component 873 and access un-rasterized vertex data via a stream out unit 823.

The graphics processor 800 has an interconnect bus, interconnect fabric, or some other interconnect mechanism that allows data and message passing amongst the major components of the processor. In some embodiments, execution units 852A-852B and associated cache(s) 851, texture and media sampler 854, and texture/sampler cache 858 interconnect via a data port 856 to perform memory access and communicate with render output pipeline components of the processor. In some embodiments, sampler 854, caches 851, 858 and execution units 852A-852B each have separate memory access paths.

In some embodiments, render output pipeline 870 contains a rasterizer and depth test component 873 that converts vertex-based objects into an associated pixel-based representation. In some embodiments, the rasterizer logic includes a windower/masker unit to perform fixed function triangle and line rasterization. An associated render cache 878 and depth cache 879 are also available in some embodiments. A pixel operations component 877 performs pixel-based operations on the data, though in some instances, pixel operations associated with 2D operations (e.g. bit block image transfers with blending) are performed by the 2D engine 841, or substituted at display time by the display controller 843 using overlay display planes. In some embodiments, a shared L3 cache 875 is available to all graphics components, allowing the sharing of data without the use of main system memory.

In some embodiments, graphics processor media pipeline 830 includes a media engine 837 and a video front end 834. In some embodiments, video front end 834 receives pipeline commands from the command streamer 803. In some embodiments, media pipeline 830 includes a separate command streamer. In some embodiments, video front-end 834 processes media commands before sending the command to the media engine 837. In some embodiments, media engine 837 includes thread spawning functionality to spawn threads for dispatch to thread execution logic 850 via thread dispatcher 831.

In some embodiments, graphics processor 800 includes a display engine 840. In some embodiments, display engine 840 is external to processor 800 and couples with the graphics processor via the ring interconnect 802, or some other interconnect bus or fabric. In some embodiments, display engine 840 includes a 2D engine 841 and a display controller 843. In some embodiments, display engine 840 contains special purpose logic capable of operating independently of the 3D pipeline. In some embodiments, display controller 843 couples with a display device (not shown), which may be a system integrated display device, as in a laptop computer, or an external display device attached via a display device connector.

In some embodiments, graphics pipeline 820 and media pipeline 830 are configurable to perform operations based on multiple graphics and media programming interfaces and are not specific to any one application programming interface (API). In some embodiments, driver software for the graphics processor translates API calls that are specific to a particular graphics or media library into commands that can be processed by the graphics processor. In some embodiments, support is provided for the Open Graphics Library (OpenGL), Open Computing Language (OpenCL), and/or Vulkan graphics and compute API, all from the Khronos Group. In some embodiments, support may also be provided for the Direct3D library from the Microsoft Corporation. In some embodiments, a combination of these libraries may be supported. Support may also be provided for the Open Source Computer Vision Library (OpenCV). A future API with a compatible 3D pipeline would also be supported if a mapping can be made from the pipeline of the future API to the pipeline of the graphics processor.

Graphics Pipeline Programming

FIG. 9A is a block diagram illustrating a graphics processor command format 900 according to some embodiments. FIG. 9B is a block diagram illustrating a graphics processor command sequence 910 according to an embodiment. The solid lined boxes in FIG. 9A illustrate the components that are generally included in a graphics command while the dashed lines include components that are optional or that are only included in a sub-set of the graphics commands. The exemplary graphics processor command format 900 of FIG. 9A includes data fields to identify a target client 902 of the command, a command operation code (opcode) 904, and the relevant data 906 for the command. A sub-opcode 905 and a command size 908 are also included in some commands.

In some embodiments, client 902 specifies the client unit of the graphics device that processes the command data. In some embodiments, a graphics processor command parser examines the client field of each command to condition the further processing of the command and route the command data to the appropriate client unit. In some embodiments, the graphics processor client units include a memory interface unit, a render unit, a 2D unit, a 3D unit, and a media unit. Each client unit has a corresponding processing pipeline that processes the commands. Once the command is received by the client unit, the client unit reads the opcode 904 and, if present, sub-opcode 905 to determine the operation to perform. The client unit performs the command using information in data field 906. For some commands an explicit command size 908 is expected to specify the size of the command. In some embodiments, the command parser automatically determines the size of at least some of the commands based on the command opcode. In some embodiments commands are aligned via multiples of a double word.

The flow diagram in FIG. 9B shows an exemplary graphics processor command sequence 910. In some embodiments, software or firmware of a data processing system that features an embodiment of a graphics processor uses a version of the command sequence shown to set up, execute, and terminate a set of graphics operations. A sample command sequence is shown and described for purposes of example only as embodiments are not limited to these specific commands or to this command sequence. Moreover, the commands may be issued as batch of commands in a command sequence, such that the graphics processor will process the sequence of commands in at least partially concurrence.

In some embodiments, the graphics processor command sequence 910 may begin with a pipeline flush command 912 to cause any active graphics pipeline to complete the currently pending commands for the pipeline. In some embodiments, the 3D pipeline 922 and the media pipeline 924 do not operate concurrently. The pipeline flush is performed to cause the active graphics pipeline to complete any pending commands. In response to a pipeline flush, the command parser for the graphics processor will pause command processing until the active drawing engines complete pending operations and the relevant read caches are invalidated. Optionally, any data in the render cache that is marked ‘dirty’ can be flushed to memory. In some embodiments, pipeline flush command 912 can be used for pipeline synchronization or before placing the graphics processor into a low power state.

In some embodiments, a pipeline select command 913 is used when a command sequence requires the graphics processor to explicitly switch between pipelines. In some embodiments, a pipeline select command 913 is required only once within an execution context before issuing pipeline commands unless the context is to issue commands for both pipelines. In some embodiments, a pipeline flush command 912 is required immediately before a pipeline switch via the pipeline select command 913.

In some embodiments, a pipeline control command 914 configures a graphics pipeline for operation and is used to program the 3D pipeline 922 and the media pipeline 924. In some embodiments, pipeline control command 914 configures the pipeline state for the active pipeline. In one embodiment, the pipeline control command 914 is used for pipeline synchronization and to clear data from one or more cache memories within the active pipeline before processing a batch of commands.

In some embodiments, return buffer state commands 916 are used to configure a set of return buffers for the respective pipelines to write data. Some pipeline operations require the allocation, selection, or configuration of one or more return buffers into which the operations write intermediate data during processing. In some embodiments, the graphics processor also uses one or more return buffers to store output data and to perform cross thread communication. In some embodiments, the return buffer state 916 includes selecting the size and number of return buffers to use for a set of pipeline operations.

The remaining commands in the command sequence differ based on the active pipeline for operations. Based on a pipeline determination 920, the command sequence is tailored to the 3D pipeline 922 beginning with the 3D pipeline state 930 or the media pipeline 924 beginning at the media pipeline state 940.

The commands to configure the 3D pipeline state 930 include 3D state setting commands for vertex buffer state, vertex element state, constant color state, depth buffer state, and other state variables that are to be configured before 3D primitive commands are processed. The values of these commands are determined at least in part based on the particular 3D API in use. In some embodiments, 3D pipeline state 930 commands are also able to selectively disable or bypass certain pipeline elements if those elements will not be used.

In some embodiments, 3D primitive 932 command is used to submit 3D primitives to be processed by the 3D pipeline. Commands and associated parameters that are passed to the graphics processor via the 3D primitive 932 command are forwarded to the vertex fetch function in the graphics pipeline. The vertex fetch function uses the 3D primitive 932 command data to generate vertex data structures. The vertex data structures are stored in one or more return buffers. In some embodiments, 3D primitive 932 command is used to perform vertex operations on 3D primitives via vertex shaders. To process vertex shaders, 3D pipeline 922 dispatches shader execution threads to graphics processor execution units.

In some embodiments, 3D pipeline 922 is triggered via an execute 934 command or event. In some embodiments, a register write triggers command execution. In some embodiments execution is triggered via a ‘go’ or ‘kick’ command in the command sequence. In one embodiment, command execution is triggered using a pipeline synchronization command to flush the command sequence through the graphics pipeline. The 3D pipeline will perform geometry processing for the 3D primitives. Once operations are complete, the resulting geometric objects are rasterized and the pixel engine colors the resulting pixels. Additional commands to control pixel shading and pixel back end operations may also be included for those operations.

In some embodiments, the graphics processor command sequence 910 follows the media pipeline 924 path when performing media operations. In general, the specific use and manner of programming for the media pipeline 924 depends on the media or compute operations to be performed. Specific media decode operations may be offloaded to the media pipeline during media decode. In some embodiments, the media pipeline can also be bypassed and media decode can be performed in whole or in part using resources provided by one or more general purpose processing cores. In one embodiment, the media pipeline also includes elements for general-purpose graphics processor unit (GPGPU) operations, where the graphics processor is used to perform SIMD vector operations using computational shader programs that are not explicitly related to the rendering of graphics primitives.

In some embodiments, media pipeline 924 is configured in a similar manner as the 3D pipeline 922. A set of commands to configure the media pipeline state 940 are dispatched or placed into a command queue before the media object commands 942. In some embodiments, media pipeline state commands 940 include data to configure the media pipeline elements that will be used to process the media objects. This includes data to configure the video decode and video encode logic within the media pipeline, such as encode or decode format. In some embodiments, media pipeline state commands 940 also support the use of one or more pointers to “indirect” state elements that contain a batch of state settings.

In some embodiments, media object commands 942 supply pointers to media objects for processing by the media pipeline. The media objects include memory buffers containing video data to be processed. In some embodiments, all media pipeline states must be valid before issuing a media object command 942. Once the pipeline state is configured and media object commands 942 are queued, the media pipeline 924 is triggered via an execute command 944 or an equivalent execute event (e.g., register write). Output from media pipeline 924 may then be post processed by operations provided by the 3D pipeline 922 or the media pipeline 924. In some embodiments, GPGPU operations are configured and executed in a similar manner as media operations.

Graphics Software Architecture

FIG. 10 illustrates exemplary graphics software architecture for a data processing system 1000 according to some embodiments. In some embodiments, software architecture includes a 3D graphics application 1010, an operating system 1020, and at least one processor 1030. In some embodiments, processor 1030 includes a graphics processor 1032 and one or more general-purpose processor core(s) 1034. The graphics application 1010 and operating system 1020 each execute in the system memory 1050 of the data processing system.

In some embodiments, 3D graphics application 1010 contains one or more shader programs including shader instructions 1012. The shader language instructions may be in a high-level shader language, such as the High Level Shader Language (HLSL) or the OpenGL Shader Language (GLSL). The application also includes executable instructions 1014 in a machine language suitable for execution by the general-purpose processor core 1034. The application also includes graphics objects 1016 defined by vertex data.

In some embodiments, operating system 1020 is a Microsoft® Windows® operating system from the Microsoft Corporation, a proprietary UNIX-like operating system, or an open source UNIX-like operating system using a variant of the Linux kernel. The operating system 1020 can support a graphics API 1022 such as the Direct3D API, the OpenGL API, or the Vulkan API. When the Direct3D API is in use, the operating system 1020 uses a front-end shader compiler 1024 to compile any shader instructions 1012 in HLSL into a lower-level shader language. The compilation may be a just-in-time (JIT) compilation or the application can perform shader pre-compilation. In some embodiments, high-level shaders are compiled into low-level shaders during the compilation of the 3D graphics application 1010. In some embodiments, the shader instructions 1012 are provided in an intermediate form, such as a version of the Standard Portable Intermediate Representation (SPIR) used by the Vulkan API. In some embodiments, user mode graphics driver 1026 contains a back-end shader compiler 1027 to convert the shader instructions 1012 into a hardware specific representation. When the OpenGL API is in use, shader instructions 1012 in the GLSL high-level language are passed to a user mode graphics driver 1026 for compilation. In some embodiments, user mode graphics driver 1026 uses operating system kernel mode functions 1028 to communicate with a kernel mode graphics driver 1029. In some embodiments, kernel mode graphics driver 1029 communicates with graphics processor 1032 to dispatch commands and instructions.

IP Core Implementations

One or more aspects of at least one embodiment may be implemented by representative code stored on a machine-readable medium which represents and/or defines logic within an integrated circuit such as a processor. For example, the machine-readable medium may include instructions which represent various logic within the processor. When read by a machine, the instructions may cause the machine to fabricate the logic to perform the techniques described herein. Such representations, known as “IP cores,” are reusable units of logic for an integrated circuit that may be stored on a tangible, machine-readable medium as a hardware model that describes the structure of the integrated circuit. The hardware model may be supplied to various customers or manufacturing facilities, which load the hardware model on fabrication machines that manufacture the integrated circuit. The integrated circuit may be fabricated such that the circuit performs operations described in association with any of the embodiments described herein.

FIG. 11 is a block diagram illustrating an IP core development system 1100 that may be used to manufacture an integrated circuit to perform operations according to an embodiment. The IP core development system 1100 may be used to generate modular, re-usable designs that can be incorporated into a larger design or used to construct an entire integrated circuit (e.g., an SOC integrated circuit). A design facility 1130 can generate a software simulation 1110 of an IP core design in a high level programming language (e.g., C/C++). The software simulation 1110 can be used to design, test, and verify the behavior of the IP core using a simulation model 1112. The simulation model 1112 may include functional, behavioral, and/or timing simulations. A register transfer level (RTL) design 1115 can then be created or synthesized from the simulation model 1112. The RTL design 1115 is an abstraction of the behavior of the integrated circuit that models the flow of digital signals between hardware registers, including the associated logic performed using the modeled digital signals. In addition to an RTL design 1115, lower-level designs at the logic level or transistor level may also be created, designed, or synthesized. Thus, the particular details of the initial design and simulation may vary.

The RTL design 1115 or equivalent may be further synthesized by the design facility into a hardware model 1120, which may be in a hardware description language (HDL), or some other representation of physical design data. The HDL may be further simulated or tested to verify the IP core design. The IP core design can be stored for delivery to a 3^(rd) party fabrication facility 1165 using non-volatile memory 1140 (e.g., hard disk, flash memory, or any non-volatile storage medium). Alternatively, the IP core design may be transmitted (e.g., via the Internet) over a wired connection 1150 or wireless connection 1160. The fabrication facility 1165 may then fabricate an integrated circuit that is based at least in part on the IP core design. The fabricated integrated circuit can be configured to perform operations in accordance with at least one embodiment described herein.

Exemplary System on a Chip Integrated Circuit

FIGS. 12-14 illustrated exemplary integrated circuits and associated graphics processors that may be fabricated using one or more IP cores, according to various embodiments described herein. In addition to what is illustrated, other logic and circuits may be included, including additional graphics processors/cores, peripheral interface controllers, or general purpose processor cores.

FIG. 12 is a block diagram illustrating an exemplary system on a chip integrated circuit 1200 that may be fabricated using one or more IP cores, according to an embodiment. Exemplary integrated circuit 1200 includes one or more application processor(s) 1205 (e.g., CPUs), at least one graphics processor 1210, and may additionally include an image processor 1215 and/or a video processor 1220, any of which may be a modular IP core from the same or multiple different design facilities. Integrated circuit 1200 includes peripheral or bus logic including a USB controller 1225, UART controller 1230, an SPI/SDIO controller 1235, and an I²S/I²C controller 1240. Additionally, the integrated circuit can include a display device 1245 coupled to one or more of a high-definition multimedia interface (HDM) controller 1250 and a mobile industry processor interface (MIPI) display interface 1255. Storage may be provided by a flash memory subsystem 1260 including flash memory and a flash memory controller. Memory interface may be provided via a memory controller 1265 for access to SDRAM or SRAM memory devices. Some integrated circuits additionally include an embedded security engine 1270.

FIG. 13 is a block diagram illustrating an exemplary graphics processor 1310 of a system on a chip integrated circuit that may be fabricated using one or more IP cores, according to an embodiment. Graphics processor 1310 can be a variant of the graphics processor 1210 of FIG. 12. Graphics processor 1310 includes a vertex processor 1305 and one or more fragment processor(s) 1315A1315N (e.g., 1315A. 1315B, 1315C, 1315D, through 1315N-1, and 1315N). Graphics processor 1310 can execute different shader programs via separate logic, such that the vertex processor 1305 is optimized to execute operations for vertex shader programs, while the one or more fragment processor(s) 1315A-1315N execute fragment (e.g., pixel) shading operations for fragment or pixel shader programs. The vertex processor 1305 performs the vertex processing stage of the 3D graphics pipeline and generates primitives and vertex data. The fragment processor(s) 1315A-1315N use the primitive and vertex data generated by the vertex processor 1305 to produce a framebuffer that is displayed on a display device. In one embodiment, the fragment processor(s) 1315A-1315N are optimized to execute fragment shader programs as provided for in the OpenGL API, which may be used to perform similar operations as a pixel shader program as provided for in the Direct 3D API.

Graphics processor 1310 additionally includes one or more memory management units (MMUs) 1320A-1320B, cache(s) 1325A-1325B, and circuit interconnect(s) 1330A-1330B. The one or more MMU(s) 1320A-1320B provide for virtual to physical address mapping for integrated circuit 1310, including for the vertex processor 1305 and/or fragment processor(s) 1315A-1315N, which may reference vertex or image/texture data stored in memory, in addition to vertex or image/texture data stored in the one or more cache(s) 1325A-1325B. In one embodiment the one or more MMU(s) 1325A-1325B may be synchronized with other MMUs within the system, including one or more MMUs associated with the one or more application processor(s) 1205, image processor 1215, and/or video processor 1220 of FIG. 12, such that each processor 1205-1220 can participate in a shared or unified virtual memory system. The one or more circuit interconnect(s) 1330A-1330B enable graphics processor 1310 to interface with other IP cores within the SoC, either via an internal bus of the SoC or via a direct connection, according to embodiments.

FIG. 14 is a block diagram illustrating an additional exemplary graphics processor 1410 of a system on a chip integrated circuit that may be fabricated using one or more IP cores, according to an embodiment. Graphics processor 1410 can be a variant of the graphics processor 1210 of FIG. 12. Graphics processor 1410 includes the one or more MMU(s) 1320A-1320B, caches 1325A-1325B, and circuit interconnects 1330A-1330B of the integrated circuit 1300 of FIG. 13.

Graphics processor 1410 includes one or more shader core(s) 1415A-1415N (e.g., 1415A, 1415B, 1415C, 1415D, 1415E, 1415F, through 1315N-1, and 1315N), which provides for a unified shader core architecture in which a single core or type or core can execute all types of programmable shader code, including shader program code to implement vertex shaders, fragment shaders, and/or compute shaders. The exact number of shader cores present can vary among embodiments and implementations. Additionally, graphics processor 1410 includes an inter-core task manager 1405, which acts as a thread dispatcher to dispatch execution threads to one or more shader cores 1415A-1415N and a tiling unit 1418 to accelerate tiling operations for tile-based rendering, in which rendering operations for a scene are subdivided in image space, for example to exploit local spatial coherence within a scene or to optimize use of internal caches.

FIG. 15 illustrates a computing device 1500 employing a pose regression mechanism 1510 according to one embodiment. Computing device 1500 may include an autonomous machine or an artificially intelligent agent, such as a mechanical agent or machine, an electronics agent or machine, a virtual agent or machine, an electro-mechanical agent or machine, etc. Examples of autonomous machines or artificially intelligent agents may include (without limitation) robots, autonomous vehicles (e.g., self-driving cars, self-flying planes, self-sailing boats, etc.), autonomous equipment (self-operating construction vehicles, self-operating medical equipment, etc.), and/or the like. Throughout this document, “computing device” may be synonymously referred to as “autonomous machine” or “artificially intelligent agent” or simply “robot”.

Computing device 1500 may further include smart wearable devices, virtual reality (VR) devices, head-mounted display (HMDs), mobile computers, Internet of Things (IoT) devices, laptop computers, desktop computers, server computers, etc., and be similar to or the same as data processing system 100 of FIG. 1; accordingly, for brevity, clarity, and ease of understanding, many of the details stated above with reference to FIGS. 1-14 are not further discussed or repeated hereafter. As illustrated, in one embodiment, computing device 1500 is shown as hosting pose regression mechanism 1510.

As illustrated, in one embodiment, pose regression mechanism 1510 may be hosted by or part of operating system 1506. In another embodiment, pose regression mechanism 1510 may be hosted by or part of graphics driver 1516. In yet another embodiment, pose regression mechanism 1510 may be hosted by or part of firmware of graphics processing unit (“GPU” or “graphics processor”) 1514. In yet another embodiment, pose regression mechanism 1510 may be hosted by or part of firmware of central processing unit (“CPU” or “application processor”) 1512. In yet another embodiment, pose regression mechanism 1510 may be hosted by or part of any combination of the components described above, such as a portion of pose regression mechanism 1500 may be hosted as software logic by graphics driver 1516, while another portion of pose regression mechanism 1500 may be hosted as a hardware component by graphics processor 1514.

For brevity, clarity, and ease of understanding, throughout the rest of this document, pose regression mechanism 1510 is shown and discussed as being hosted by operating system 1506; however, embodiments are not limited as such. It is contemplated and to be noted that pose regression mechanism 1510 or one or more of its components may be implemented as hardware, software, and/or firmware.

Throughout the document, term “user” may be interchangeably referred to as “viewer”, “observer”, “person”, “individual”, “end-user”, and/or the like. It is to be noted that throughout this document, terms like “graphics domain” may be referenced interchangeably with “graphics processing unit”, “graphics processor”, or simply “GPU” and similarly, “CPU domain” or “host domain” may be referenced interchangeably with “computer processing unit”, “application processor”, or simply “CPU”.

Computing device 1500 may include any number and type of communication devices, such as large computing systems, such as server computers, desktop computers, etc., and may further include set-top boxes (e.g., Internet-based cable television set-top boxes, etc.), global positioning system (GPS)-based devices, etc. Computing device 1500 may include mobile computing devices serving as communication devices, such as cellular phones including smartphones, personal digital assistants (PDAs), tablet computers, laptop computers, e-readers, smart televisions, television platforms, wearable devices (e.g., glasses, watches, bracelets, smartcards, jewelry, clothing items, etc.), media players, etc. For example, in one embodiment, computing device 1500 may include a mobile computing device employing a computer platform hosting an integrated circuit (“IC”), such as system on a chip (“SoC” or “SOC”), integrating various hardware and/or software components of computing device 1500 on a single chip.

As illustrated, in one embodiment, computing device 1500 may include any number and type of hardware and/or software components, such as (without limitation) GPU 1514, graphics driver (also referred to as “GPU driver”. “graphics driver logic”, “driver logic”, user-mode driver (UMD), UMD, user-mode driver framework (UMDF), UMDF, or simply “driver”) 1516, CPU 1512, memory 1508, network devices, drivers, or the like, as well as input/output (I/O) sources 1504, such as touchscreens, touch panels, touch pads, virtual or regular keyboards, virtual or regular mice, ports, connectors, etc. Computing device 1500 may include operating system (OS) 1506 serving as an interface between hardware and/or physical resources of the computer device 1500 and a user. It is contemplated that CPU 1512 may include one or more processors, such as processor(s) 102 of FIG. 1, while GPU 1514 may include one or more graphics processors, such as graphics processor(s) 108 of FIG. 1.

It is to be noted that terms like “node”, “computing node”, “server”, “server device”, “cloud computer”, “cloud server”, “cloud server computer”, “machine”, “host machine”, “device”, “computing device”, “computer”, “computing system”, and the like, may be used interchangeably throughout this document. It is to be further noted that terms like “application”, “software application”, “program”, “software program”, “package”, “software package”, and the like, may be used interchangeably throughout this document. Also, terms like “job”, “input”, “request”, “message”, and the like, may be used interchangeably throughout this document.

It is contemplated and as further described with reference to FIGS. 1-14, some processes of the graphics pipeline as described above are implemented in software, while the rest are implemented in hardware. A graphics pipeline may be implemented in a graphics coprocessor design, where CPU 1512 is designed to work with GPU 1514 which may be included in or co-located with CPU 1512. In one embodiment. GPU 1514 may employ any number and type of conventional software and hardware logic to perform the conventional functions relating to graphics rendering as well as novel software and hardware logic to execute any number and type of instructions, such as instructions 121 of FIG. 1, to perform the various novel functions of pose regression mechanism 1510 as disclosed throughout this document.

As aforementioned, memory 1508 may include a random access memory (RAM) comprising application database having object information. A memory controller hub, such as memory controller hub 116 of FIG. 1, may access data in the RAM and forward it to GPU 1514 for graphics pipeline processing. RAM may include double data rate RAM (DDR RAM), extended data output RAM (EDO RAM), etc. CPU 1512 interacts with a hardware graphics pipeline, as illustrated with reference to FIG. 3, to share graphics pipelining functionality. Processed data is stored in a buffer in the hardware graphics pipeline, and state information is stored in memory 1508. The resulting image is then transferred to I/O sources 1504, such as a display component, such as display device 320 of FIG. 3, for displaying of the image. It is contemplated that the display device may be of various types, such as Cathode Ray Tube (CRT), Thin Film Transistor (TFT), Liquid Crystal Display (LCD), Organic Light Emitting Diode (OLED) array, etc., to display information to a user.

Memory 1508 may comprise a pre-allocated region of a buffer (e.g., frame buffer); however, it should be understood by one of ordinary skill in the art that the embodiments are not so limited, and that any memory accessible to the lower graphics pipeline may be used. Computing device 1500 may further include input/output (I/O) control hub (ICH) 150 as referenced in FIG. 1, one or more I/O sources 1504, etc.

CPU 1512 may include one or more processors to execute instructions in order to perform whatever software routines the computing system implements. The instructions frequently involve some sort of operation performed upon data. Both data and instructions may be stored in system memory 1508 and any associated cache. Cache is typically designed to have shorter latency times than system memory 1508; for example, cache might be integrated onto the same silicon chip(s) as the processor(s) and/or constructed with faster static RAM (SRAM) cells whilst the system memory 1508 might be constructed with slower dynamic RAM (DRAM) cells. By tending to store more frequently used instructions and data in the cache as opposed to the system memory 1508, the overall performance efficiency of computing device 1500 improves. It is contemplated that in some embodiments, GPU 1514 may exist as part of CPU 1512 (such as part of a physical CPU package) in which case, memory 1508 may be shared by CPU 1512 and GPU 1514 or kept separated.

System memory 1508 may be made available to other components within the computing device 1500. For example, any data (e.g., input graphics data) received from various interfaces to the computing device 1500 (e.g., keyboard and mouse, printer port, Local Area Network (LAN) port, modem port, etc.) or retrieved from an internal storage element of the computer device 1500 (e.g., hard disk drive) are often temporarily queued into system memory 1508 prior to their being operated upon by the one or more processor(s) in the implementation of a software program. Similarly, data that a software program determines should be sent from the computing device 1500 to an outside entity through one of the computing system interfaces, or stored into an internal storage element, is often temporarily queued in system memory 1508 prior to its being transmitted or stored.

Further, for example, an ICH, such as ICH 130 of FIG. 1, may be used for ensuring that such data is properly passed between the system memory 1508 and its appropriate corresponding computing system interface (and internal storage device if the computing system is so designed) and may have bi-directional point-to-point links between itself and the observed I/O sources/devices 1504. Similarly, an MCH, such as MCH 116 of FIG. 1, may be used for managing the various contending requests for system memory 1508 accesses amongst CPU 1512 and GPU 1514, interfaces and internal storage elements that may proximately arise in time with respect to one another.

I/O sources 1504 may include one or more I/O devices that are implemented for transferring data to and/or from computing device 1500 (e.g., a networking adapter); or, for a large scale non-volatile storage within computing device 1500 (e.g., hard disk drive). User input device, including alphanumeric and other keys, may be used to communicate information and command selections to GPU 1514. Another type of user input device is cursor control, such as a mouse, a trackball, a touchscreen, a touchpad, or cursor direction keys to communicate direction information and command selections to GPU 1514 and to control cursor movement on the display device. Camera and microphone arrays of computer device 1500 may be employed to observe gestures, record audio and video and to receive and transmit visual and audio commands.

Computing device 1500 may further include network interface(s) to provide access to a network, such as a LAN, a wide area network (WAN), a metropolitan area network (MAN), a personal area network (PAN), Bluetooth, a cloud network, a mobile network (e.g., 3^(rd) Generation (3G), 4^(th) Generation (4G), etc.), an intranet, the Internet, etc. Network interface(s) may include, for example, a wireless network interface having antenna, which may represent one or more antenna(e). Network interface(s) may also include, for example, a wired network interface to communicate with remote devices via network cable, which may be, for example, an Ethernet cable, a coaxial cable, a fiber optic cable, a serial cable, or a parallel cable.

Network interface(s) may provide access to a LAN, for example, by conforming to IEEE 802.11b and/or IEEE 802.11 g standards, and/or the wireless network interface may provide access to a personal area network, for example, by conforming to Bluetooth standards. Other wireless network interfaces and/or protocols, including previous and subsequent versions of the standards, may also be supported. In addition to, or instead of, communication via the wireless LAN standards, network interface(s) may provide wireless communication using, for example, Time Division, Multiple Access (TDMA) protocols, Global Systems for Mobile Communications (GSM) protocols, Code Division, Multiple Access (CDMA) protocols, and/or any other type of wireless communications protocols.

Network interface(s) may include one or more communication interfaces, such as a modem, a network interface card, or other well-known interface devices, such as those used for coupling to the Ethernet, token ring, or other types of physical wired or wireless attachments for purposes of providing a communication link to support a LAN or a WAN, for example. In this manner, the computer system may also be coupled to a number of peripheral devices, clients, control surfaces, consoles, or servers via a conventional network infrastructure, including an Intranet or the Internet, for example.

It is to be appreciated that a lesser or more equipped system than the example described above may be preferred for certain implementations. Therefore, the configuration of computing device 1500 may vary from implementation to implementation depending upon numerous factors, such as price constraints, performance requirements, technological improvements, or other circumstances. Examples of the electronic device or computer system 1500 may include (without limitation) an artificial intelligent agent (e.g., robot), a mobile device, a personal digital assistant, a mobile computing device, a smartphone, a cellular telephone, a handset, a one-way pager, a two-way pager, a messaging device, a computer, a personal computer (PC), a desktop computer, a laptop computer, a notebook computer, a handheld computer, a tablet computer, a server, a server array or server farm, a web server, a network server, an Internet server, a work station, a mini-computer, a main frame computer, a supercomputer, a network appliance, a web appliance, a distributed computing system, multiprocessor systems, processor-based systems, consumer electronics, programmable consumer electronics, television, digital television, set top box, wireless access point, base station, subscriber station, mobile subscriber center, radio network controller, router, hub, gateway, bridge, switch, machine, or combinations thereof.

Embodiments may be implemented as any or a combination of: one or more microchips or integrated circuits interconnected using a parentboard, hardwired logic, software stored by a memory device and executed by a microprocessor, firmware, an application specific integrated circuit (ASIC), and/or a field programmable gate array (FPGA). The term “logic” may include, by way of example, software or hardware and/or combinations of software and hardware.

Embodiments may be provided, for example, as a computer program product which may include one or more machine-readable media having stored thereon machine-executable instructions that, when executed by one or more machines such as a computer, network of computers, or other electronic devices, may result in the one or more machines carrying out operations in accordance with embodiments described herein. A machine-readable medium may include, but is not limited to, floppy diskettes, optical disks, CD-ROMs (Compact Disc-Read Only Memories), and magneto-optical disks, ROMs, RAMs, EPROMs (Erasable Programmable Read Only Memories), EEPROMs (Electrically Erasable Programmable Read Only Memories), magnetic or optical cards, flash memory, or other type of media/machine-readable medium suitable for storing machine-executable instructions.

Moreover, embodiments may be downloaded as a computer program product, wherein the program may be transferred from a remote computer (e.g., a server) to a requesting computer (e.g., a client) by way of one or more data signals embodied in and/or modulated by a carrier wave or other propagation medium via a communication link (e.g., a modem and/or network connection).

FIG. 16 illustrates pose regression mechanism 1510 of FIG. 15 according to one embodiment. For brevity, many of the details already discussed with reference to FIGS. 1-15 are not repeated or discussed hereafter. In one embodiment, pose regression mechanism 1510 may include any number and type of components, such as (without limitations): detection/reception logic 1601; formation logic 1603; decomposed angle estimation and prediction logic (“estimation and prediction logic” or “decomposed angle estimator”) 1605; transition logic 1607; execution/forwarding logic 1609; and communication/compatibility logic 1611.

Computing device 1500 (e.g., automated machine, such as a robot, a vehicle, etc.) is further shown to be in communication with one or more repositories, datasets, and/or databases, such as database(s) 1630 (e.g., cloud storage, non-cloud storage, etc.), where database(s) 1630 may reside at a local storage or a remote storage over communication medium(s) 1625, such as one or more networks (e.g., cloud network, proximity network, mobile network, intranet, Internet, etc.).

It is contemplated that a software application running at computing device 1500 may be responsible for performing or facilitating performance of any number and type of tasks using one or more components (e.g., GPU 1514, graphics driver 1516, CPU 1512, etc.) of computing device 1500. When performing such tasks, as defined by the software application, one or more components, such as GPU 1514, graphics driver 1516, CPU 1512, etc., may communicate with each other to ensure accurate and timely processing and completion of those tasks.

As aforementioned, there are several rotation representing techniques, including matrix, quaternion, classic Euler angle, etc., but such conventional techniques are not equally or efficiently performed in relation to pose regression tasks. Embodiments provide for using a novel decomposed angle estimator to estimate a four-dimensional (4D) decomposed angle or six-dimensional (6D) decomposed angle that is different from the classic three-dimensional (3D) Euler angle and thus, this decomposed angle estimator performs better than any of the conventional quaternions or Euler angles, etc. This is particularly beneficial when dealing with training neural networks.

It is contemplated that pose regression from raw image data in robots, such as computing device 1500, typically relies on one fundamental property, which is close images generating close pose labels. This unique property is often not handled properly by any of the conventional tools or techniques, such as quaternions or Euler angles. For example, a robot, such as computing device 1500, may walk around and turn to any direction in a room while looking left and right (“yaw”) and up and down in a little range (“pitch”) and further, it may also rotate within a viewpoint (“roll”) such that its field is capable of forming a girdle around the equator of the sphere. Now suppose the original direction of the robot 1500 is north while it may also look south. When the direction south moves towards a little a little west (such as south-west), the quaternion label would be [0, −0.9998, 0, +0.02], while the decomposed angle label would be [−0.999, −0.03] and similarly, when the south is a little east (such as south-east), the quaternion label would be [0, +0.9998, 0, +0.02], while the decomposed angle label would be [−0.999, +0.03, 0]. In other words, although robot 1500 sees very similar images, its conventional quaternion labels are completely the opposite, while its novel decomposed angle labels are similar, which makes the novel decomposed angle estimator is much superior and efficient than the conventional quaternion when used in pose regression from raw images.

In one embodiment, detection/reception logic 1601 to detect image data relating to an image as captured by one or more I/O sources 1504 of FIG. 15, such as one or more camera(s), one or more robotic eye(s), etc., associated with computing device 1500. In one embodiment, detection/reception logic 1601 may further detect a rotation representation, such as original matrix or quaternion pose labels corresponding to rotation representations associated with the image data. It is contemplated that the original image pose labels may be formatted as rotation matrix or quaternions since the rotation representations may be matrix or quaternions, as illustrated in FIG. 19A. For example, quaternions may be used to calculate the different of two rotations such that to report meaningful prediction error, while any ground truths and predictions are transferred to quaternions.

In one embodiment, formation logic 1603 may be used to form a transition layer, as illustrated in FIG. 19A, which may then be used to translate the rotation from the original matrix or quaternion representations to the novel decomposed 4D angle representations and vice versa. In one embodiment, estimation and prediction logic 1605 may then be used to compute and provide angle predictions based on the decomposed angle estimator, while these decomposed angle predications are then transitioned back into quaternion predictions as facilitated by transition logic 1607.

In one embodiment, execution/forwarding logic 1609 may then be triggered to executed the decomposed angle label into a loss layer resulting in network losses, while any transitioned quaternion predictions are then executed into an error report layers resulting in prediction errors.

In one embodiment, decomposed angle estimator provides 4D special representations, such as cos(yaw), sin(yaw), pitch, and roll, which allows for a better representations and subsequent predictions. For example, in a network topology of a decomposed angle label neural network, cos(yaw) and sin(yaw) are regarded as unit vector, while a normalized layer is put before cos(yaw) and sin(yaw), resulting in generating better and more accurate results. Further, as aforementioned, if a decomposed angle does not provide for a normal representation of a rotation when training or testing a network, the decomposed angle may be transformed from and into rotation matrix or quaternion to facilitate estimation and prediction logic 1605 to compute rotation errors.

For example, a quaternion is a normalized vector of four scalar q=[qx, qy, qz, qw], indicating the original coordinate system is rotated according to axis [0, 0, 0]-[qx, qy, qz] an angle 2*arccos(qw). One interesting property of quaternion is that q=[qx, qy, qz, qw] is exactly the same in meaning as −q=[−qx, −qy, −qz, −qw], which is understandable, that, rotating around axis [0, 0, 0]-[−qx, −qy, −qz] an angle 2*arccos(−qw) is the same of rotating around axis [0, 0, 0]-[qx, qy, qz] an angle 2*arccos(qw), when considering the truth that 2*arccos(−qw)=2π−2*arccos(qw)=−2*arccos(qw). In a unique case, this property forces two close images, such as A and B, having totally opposite label LA and LB, respectively, where LA≈−LB, which can significantly confuse the neural network training process.

Now, with regard to the conventional Euler angle, it has its own set of issues and limitations. One such problem with the conventional Euler angle is known as “gimbal lock”, which can significantly limit the Euler angle's representation ability when compared to quaternion. Euler angle is a vector of three scalars [yaw, pitch, roll] according to three rotation axes and since the rotations are capable of being applied to static or rotating frames and the successive rotation axes are in the order of x, y or z, there are 24 types of Euler angle representations. Typically, the upside or upward axis of cameras is defined as y, the right of cameras as x, and the forward of cameras as z, and finally, the axes of an original camera pose is the world coordinate. In this definition, yaw rolls around y, pitch around x, and roll around z, where the yaw angle range is in [−π, +π], the pitch range is [−π/2, +π/2], and the roll range is [−π, +π]. The similar property applies to Euler angle representation: such as for yaw and roll angles, there exist cases where close images are labeled composite labels −π or +π. For yaw angle, this case occurs when camera is looking for [0, 0, −1]. These labels should be continuous around −π or +π, but the number system represents them in a non-continuous manner.

It is contemplated that the aforementioned issues cause the neural network training system to be confused and wrongly fit the non-continuous labels. In one embodiment, a novel decomposed 4D angle is provided to be used in neural network training systems to entirely avoid or efficiently resolve any issues associated with conventional techniques. For example, this decomposed 4D angle may be defined as a vector of four scalars, such as [cos(yaw), sin(yaw), pitch, roll], by decomposing yaw to cos(yaw) and sin(yaw), which provides for continuous labels around yaw=−π or +π. In another embodiment, a novel decomposed 6D angle may be offered to provide an alternate viewpoint-rotation representation involving 6D scalars, such as [cos(pitch)*cos(yaw), cos(pitch)*sin(yaw), sin(pitch), roll], having the same properties as the decomposed 4D angle.

In some embodiments, such as in case of robotic applications, the conventional gimbal lock problem can be entirely avoided in real applications. For example, a robot usually turns around in a room, looking up and down and rolling its eyes a little, which typically means the yaw is in a range of [−π or +π], while pitch and roll are in [−π/6 or +π/6]. In real applications, the quaternion and Euler are not continuous around yaw=−π or +π, but a decomposed angle is continuous as facilitated by the decomposed angle estimator as further facilitated by pose regression mechanism 1510.

It is contemplated that embodiments are not limited to any particular device, but that in one embodiment, computing device 1500 may include a robot and thus robot vendors, such as engine companies, data analysis companies, etc., may employ one or more embodiments to alter fundamental techniques and designs of CNN to predict localization and pose in bigger environments and similarly, in case of a general convolutional layer technique that can be potentially used in other applications, expending feature maps is dual to shrinking feature maps.

For example, this novel decomposed angle estimator is distinct from quaternion in that their rotation representations are different, such as a decomposed angle may not be directly used in a rotation-based computation such that it may be translated to matrix or quaternion for mutilations. In other words, the decomposed angle label neural network outputs may not be directly used in a system and if the neural module output decomposed angle is translated to other forms, then one or more embodiments may be employed, such as when the network is implemented in GPU 1514 or special hardware. For example, in one embodiment, the decomposed angle may include a particular property that the first two numbers can satisfy, such as cos(yaw)²+sin(yaw)²=1, while a viewpoint-angle representation can satisfy the first three number square sum equals to one, while quaternion has a property that qx²+qy²+qz²+qw²=1.

Communication/compatibility logic 1611 may be used to facilitate dynamic communication and compatibility between computing device 1500 and any number and type of other computing devices (such as mobile computing device, desktop computer, server computing device, etc.); processing devices or components (such as CPUs. GPUs, etc.); capturing/sensing/detecting devices (such as capturing/sensing components including cameras, depth sensing cameras, camera sensors, red green blue (RGB) sensors, microphones, etc.); display devices (such as output components including display screens, display areas, display projectors, etc.); user/context-awareness components and/or identification/verification sensors/devices (such as biometric sensors/detectors, scanners, etc.); database(s) 1630, such as memory or storage devices, databases, and/or data sources (such as data storage devices, hard drives, solid-state drives, hard disks, memory cards or devices, memory circuits, etc.); communication medium(s) 1625, such as one or more communication channels or networks (e.g., Cloud network, the Internet, intranet, cellular network, proximity networks, such as Bluetooth, Bluetooth low energy (BLE). Bluetooth Smart, Wi-Fi proximity. Radio Frequency Identification (RFID), Near Field Communication (NFC), Body Area Network (BAN), etc.); wireless or wired communications and relevant protocols (e.g., Wi-Fi®, WiMAX, Ethernet, etc.); connectivity and location management techniques; software applications/websites (e.g., social and/or business networking websites, etc., business applications, games and other entertainment applications, etc.); and programming languages, etc., while ensuring compatibility with changing technologies, parameters, protocols, standards, etc.

Throughout this document, terms like “logic”, “component”, “module”, “framework”, “engine”, “mechanism”, and the like, may be referenced interchangeably and include, by way of example, software, hardware, and/or any combination of software and hardware, such as firmware. In one example, “logic” may refer to or include a software component that is capable of working with one or more of an operating system (e.g., operating system 1506), a graphics driver (e.g., graphics driver 1516), etc., of a computing device, such as computing device 1500. In another example “logic” may refer to or include a hardware component that is capable of being physically installed along with or as part of one or more system hardware elements, such as an application processor (e.g., CPU 1512), a graphics processor (e.g., GPU 1514), etc., of a computing device, such as computing device 1500. In yet another embodiment, “logic” may refer to or include a firmware component that is capable of being part of system firmware, such as firmware of an application processor (e.g., CPU 1512) or a graphics processor (e.g., GPU 1514), etc., of a computing device, such as computing device 1500.

Further, any use of a particular brand, word, term, phrase, name, and/or acronym, such as “GPU”, “GPU domain”, “GPGPU”, “CPU”, “CPU domain”, “graphics driver”, “workload”, “application”, “graphics pipeline”, “pipeline processes”, “robot”, “Euler”, “angle”, “decomposed”, “4D”. “training”, “caching”, “pose regression”, “neural network”. “convolutional neural network”, “CNN”, “Euler4”, “execution unit”, “EU”. “instruction”, “autonomous machine”, “artificially intelligent agent”, “robot”, “autonomous vehicle”, “autonomous equipment”, “API”. “3D API”, “OpenGL®”, “DirectX®”, “hardware”, “software”, “agent”, “graphics driver”, “kernel mode graphics driver”, “user-mode driver”, “user-mode driver framework”, “buffer”, “graphics buffer”, “task”. “process”, “operation”, “software application”, “game”, etc., should not be read to limit embodiments to software or devices that carry that label in products or in literature external to this document.

It is contemplated that any number and type of components may be added to and/or removed from pose regression mechanism 1510 to facilitate various embodiments including adding, removing, and/or enhancing certain features. For brevity, clarity, and ease of understanding of pose regression mechanism 1510, many of the standard and/or known components, such as those of a computing device, are not shown or discussed here. It is contemplated that embodiments, as described herein, are not limited to any particular technology, topology, system, architecture, and/or standard and are dynamic enough to adopt and adapt to any future changes.

FIG. 17 illustrates girdle of a field of view 1700 associated with an autonomous machine (e.g., robot) according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-16 may not be discussed or repeated hereafter. As aforementioned, computing device 1500 may include a robot and illustrated here is a girdle representing field of view (or simply referred to as “view field”) 1700 of robot 1500. In one embodiment, using decomposed angle estimator, several properties can be observed from this field of view 1700 to perform pose regressions, where quaternion is not capable of observing any of such properties. For example, in some embodiments, some of the observable properties may include: 1) view field 1700 may be formed as a girdle around the equator and not an arbitrary direction in a sphere which arbitrary roll angle; further, in these cases, a decomposed angle is far more descriptive for the rotation space than the quaternion; 2) the decomposed angle is continuous, while quaternion and classic Euler angles are not continuous in any number of poses; 3) a two quaternion rotation angle difference may be Angle=2 arccos(q1·q2), while across a function's derivative is flat when q1·q2 is limit to 1, which makes quaternion hard to train; 4) a much heavier weight for quaternion than translation is observed when using a network to regress quaternion and translation together, while the decomposed angle does not need to use the weight heavier than translation; 5) the decomposed angle converses faster than and is more stable than the quaternion; and 6) regression errors associated with the decomposed angle are small than those associated with the quaternion.

FIG. 18A illustrates a conventional neural network model 1800 using quaternion. For brevity, many of the details previously discussed with reference to FIGS. 1-17 may not be discussed or repeated hereafter. As illustrated, neural network model 1800 relating to images 1851 offers a vector of four scalar (e.g., q0, q1, q2, q3), such as vector 1807, being generated into a regression layer by one layer full-connection layer 1805 and convolution layers 1803.

FIG. 18B illustrates a conventional neural network model 1820 using quaternion. For brevity, many of the details previously discussed with reference to FIGS. 1-18A may not be discussed or repeated hereafter. In some cases, such as in compare experiments, for images 1801, the illustrated neural network model 1820 of quaternion regression of may used, where another normalize layer 1809 may be used to help with the quaternion results, such as normalize layer 1809 can help satisfy any constraints of a unit vector, such as unit vector 1811 by definition. (q₀ ²+q₁ ²+q₂ ²+q₃ ²=1), where normalize layer 1809 can help a quaternion satisfy this constraint through convolution layers 1803 and full connection layers 1805.

FIG. 18C illustrates a neural network model 1850 using a decomposed 6D angle as facilitated by pose regression mechanism 1510 of FIG. 15 according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-18B may not be discussed or repeated hereafter. For example, in one embodiment, using the novel decomposed 6D angle, neural network model 1850 relating to images 1851 may decompose every Euler angle to two components as cos(yaw), sin(yaw), cos(pitch), sin(pitch), cos(roll), and sin(roll) being represented as results 1859 achieved through convolution layers 1853, full connection layers 1855, and normalize layer 1857.

FIG. 18D illustrates a neural network model 1870 using a decomposed 6D angle as facilitated by pose regression mechanism 1510 of FIG. 15 according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-18C may not be discussed or repeated hereafter. As with neural network model 1850 of FIG. 18C, a decomposed 4D angle is used to achieve unit vector in results 1871 having [cos(yaw), sin(yaw), pitch, and roll] through convolution layers 1853 and full connection layers 1855, but without a normalize layer.

FIG. 18E illustrates a neural network model 1880 using a decomposed 6D angle as facilitated by pose regression mechanism 1510 of FIG. 15 according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-18D may not be discussed or repeated hereafter. Using neural network model 1870 of FIG. 18D, since [cos(yaw) and sin(yaw)] are unit vector, it is regarded as useful and more efficient to include a normalize layer, such as normalize layer 1881, before cos(yaw) and sin(yaw), as illustrated, to achieve better collective results 1883.

Further, as can be seen in comparison with the decomposed 6D angle-based neural network model 1850 of FIG. 18C, cos(pitch), sin(pitch), cos(roll), and sin(roll), the decomposed 4D angle-based neural models 1870 and 1880 of FIGS. 18D and 18E, respectively, are simply offered as pitch and roll.

FIG. 19A illustrates a conventional transaction sequence 1900 using quaternion. For brevity, many of the details previously discussed with reference to FIGS. 1-18E may not be discussed or repeated hereafter. In the illustrated embodiment, input image 1901 is put through a network at block 1903 and using quaternion 1905, such that a transition from quaternion to matrix 1909 is performed and obtained at block 1907, wherein quaternion 1905 and matrix 1909 are combined into other parts of an application, such as a software application, to consume the rotation information at block 1911.

FIG. 19B illustrates a transaction sequence 1920 using a decomposed angle estimator as facilitated by pose regression mechanism 1510 of FIG. 15 according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-19A may not be discussed or repeated hereafter. Transaction sequence 1920 may be performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, programmable logic, etc.), software (such as instructions run on a processing device), or a combination thereof, as facilitated by pose regression mechanism 1510 of FIG. 15. The processes of transaction sequence 1920 are illustrated in linear sequences for brevity and clarity in presentation; however, it is contemplated that any number of them can be performed in parallel, asynchronously, or in different orders.

In one embodiment, decomposed angle 1925 may be used to in a neural network such that its inference procedure is used in applications. Since rotation matrix 1933 and quaternion 1929 are more mathematics convenient for the purposes of calculations, the network-outputted decomposed angle numbers are not directly consumed by other parts of application and that they are translated to quaternion 1929 or matrix 1933, which is prominently distinct from conventional techniques.

For example, input image 1921 is put through network at block 1923 resulting in decomposed angle 1925, leading to conversion from decomposed angle to quaternion 1929 at block 1927. Then, as with FIG. 19A, quaternion 1929 is transitioned into matrix 1933 at block 1931 and the two are used in other parts of an application to consume the rotation information at block 1935.

FIG. 19C illustrates a transaction sequence 1950 using a decomposed angle estimator as facilitated by pose regression mechanism 1510 of FIG. 15 according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-19B may not be discussed or repeated hereafter. Transaction sequence 1950 may be performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, programmable logic, etc.), software (such as instructions run on a processing device), or a combination thereof, as facilitated by pose regression mechanism 1510 of FIG. 15. The processes of transaction sequence 1950 are illustrated in linear sequences for brevity and clarity in presentation; however, it is contemplated that any number of them can be performed in parallel, asynchronously, or in different orders.

As illustrated, in one embodiment, transition layer A 1955 is used to translate the rotation from matrix/quaternion representation labels 1953 to decomposed angle representation labels 1957, leading to loss of layer at block 1959 and network loss 1961. In one embodiment, as illustrated, image data 1951 is put through network 1971 to produce decomposed angle prediction 1973, leading to loss of layer at block 1959 and network loss 1961 or to transition layer C 1975, which translates vice versa, such as from decomposed angle prediction 1973 to quaternion prediction 1977. In case of an error, transaction sequence 1950 continues with error report layer at block 1967 to prediction error 1969. Similarly, transition layer B 1963 leads to quaternion label 1965, which may lead to error report layer at block 1967 to prediction error 1969.

FIG. 19D illustrates a transaction sequence 1980 using a decomposed angle estimator as facilitated by pose regression mechanism 1510 of FIG. 15 according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-19C may not be discussed or repeated hereafter. Transaction sequence 1980 may be performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, programmable logic, etc.), software (such as instructions run on a processing device), or a combination thereof, as facilitated by pose regression mechanism 1510 of FIG. 15. The processes of transaction sequence 1980 are illustrated in linear sequences for brevity and clarity in presentation; however, it is contemplated that any number of them can be performed in parallel, asynchronously, or in different orders.

As previously discussed with reference to FIG. 19C, since the decomposed angle is not a normal representation of rotation, when training and testing a neural network, the decomposed angle may be transformed to and from a rotation matrix or quaternion to calculate any rotation errors. For example, as illustrated, transaction sequence 1980 includes image data 1951 and the relevant matrix or quaternion labels 1953, where transition layer 1981 provides for decomposed angle label 1957, leading to loss layer at 1959 and network loss 1961. It is contemplated that transition layer 1981 here represents or may include transition layers A 1955 and B 1963 of FIG. 19C. Further, as shown in FIG. 19C, transition layer 1981 may lead to quaternion label 1965 and, in case of an error, to error report layer 1967 and prediction error 1969.

Similarly, as illustrated in FIG. 19C, image data 1951 may be put through network 1971, resulting in decomposed predictions 1973 and then to either loss layer 1959 leading to network loss 1961 or another transition layer 1975 (similar to or the same as transition layer C 1975 of FIG. 19C) to quaternion prediction 1977 and, in case of an error, to error report layer 1967, followed by prediction error 1969.

FIG. 20A illustrates a table 2000 indicating a decomposed angle being superior to a quaternion according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-19D may not be discussed or repeated hereafter. For example, if two neural networks are configured with similar topology with only the rotation layer as quaternion or decomposed angle and the translation layer is the same, the quaternion would require much heavier weights. A shown in table 2000, although the average rotation errors are similar (such as 11.74 for quaternion versus 11.80 for decomposed angle), the translation error for the quaternion (such as 0.80) is much bigger than that for the decomposed angle (such as 0.65), where this translation error along with the training epoch are neatly illustrated in graph 2010 and graph 2020 of FIG. 20B and FIG. 20C, respectively. This technique provides that decomposed angle-based networks have much faster converging speeds and better stability than the ones based on quaternions.

FIG. 20D illustrates a table 2030 indicating a decomposed angle being superior to a quaternion according to one embodiment. For brevity, many of the details previously discussed with reference to FIGS. 1-20C may not be discussed or repeated hereafter. For example, if two neural networks are spitted to dedicate translation and rotation subnet from stage three and provide for a combined view synthesis technique to improve training results, the two networks would be configured with similar topology with only the rotation as quaternion or decomposed angle, resulting in decomposed angle-based network getting better results, such as faster converging speeds and better stability as neatly illustrated in graph 2040 and graph 2050 of FIG. 20E and FIG. 20F, respectively. This technique provides that decomposed angle-based networks have much faster converging speeds and better stability than the ones based on quaternions.

References to “one embodiment”, “an embodiment”, “example embodiment”, “various embodiments”, etc., indicate that the embodiment(s) so described may include particular features, structures, or characteristics, but not every embodiment necessarily includes the particular features, structures, or characteristics. Further, some embodiments may have some, all, or none of the features described for other embodiments.

In the foregoing specification, embodiments have been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of embodiments as set forth in the appended claims. The Specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.

In the following description and claims, the term “coupled” along with its derivatives, may be used. “Coupled” is used to indicate that two or more elements co-operate or interact with each other, but they may or may not have intervening physical or electrical components between them.

As used in the claims, unless otherwise specified the use of the ordinal adjectives “first”, “second”, “third”, etc., to describe a common element, merely indicate that different instances of like elements are being referred to, and are not intended to imply that the elements so described must be in a given sequence, either temporally, spatially, in ranking, or in any other manner.

The following clauses and/or examples pertain to further embodiments or examples. Specifics in the examples may be used anywhere in one or more embodiments. The various features of the different embodiments or examples may be variously combined with some features included and others excluded to suit a variety of different applications. Examples may include subject matter such as a method, means for performing acts of the method, at least one machine-readable medium including instructions that, when performed by a machine cause the machine to performs acts of the method, or of an apparatus or system for facilitating hybrid communication according to embodiments and examples described herein.

Some embodiments pertain to Example 1 that includes an apparatus to facilitate training and deploying of pose regression in neural networks in autonomous machines, the apparatus comprising: an image capturing device to capture one or more images of one or more objects, wherein the one or more images include one or more training images associated with a neural network; decomposed angle estimation and prediction logic (“estimation and prediction logic”) to continuously estimate, in real-time, a present orientation of the apparatus, wherein estimating includes continuously detecting a real-time view field as viewed by the image capturing device and based on the one or more images; and execution/forwarding logic to apply pose regression relating to the image capturing device using the real-time view field.

Example 2 includes the subject matter of Example 1, wherein the view field to provide at least one of translations representing global coordinates and rotations representing movements of the image capturing device along its axes, wherein applying pose regression includes adjusting the present orientation of the apparatus to facilitate accurate capturing of input data and offering of output results associated with workings of the neural network.

Example 3 includes the subject matter of Example 1, further comprising: formation logic to form at least one of rotation matrix and rotation quaternion corresponding to rotation representations of the one or more images; and transition logic to transition the rotation matrix or the rotation quaternion to decomposed angle representation using the angle estimator.

Example 4 includes the subject matter of Example 3, wherein decomposed angle representations include a plurality of angles associated with the movements of the image capturing device, wherein the plurality of angles are presented as one or more of cos(yaw), sin(yaw), cos(pitch), sin(pitch), cos(roll), and sin(roll).

Example 5 includes the subject matter of Example 1, wherein the estimation and prediction logic is further to estimate, in real-time, a difference between two consecutive rotations, wherein the difference is regarded as a prediction error.

Example 6 includes the subject matter of Example 5, wherein the execution/forwarding logic is further to apply the prediction error to the pose regression, wherein applying includes adjusting the pose regression in accordance with the prediction error.

Example 7 includes the subject matter of Example 6, wherein the estimation and prediction logic is further to dynamically estimate, in real-time, a future orientation of the apparatus based on the adjustment to the pose regression.

Example 8 includes the subject matter of Example 1, wherein the input capturing device comprises at least one of one or more cameras, one or more robot eyes, one or more microphones, and one or more sensors, wherein the apparatus comprises an autonomous machine or an artificially intelligent agent, wherein the autonomous machine includes at least one of one or more robots, one or more self-driving vehicles, and one or more self-operating equipment.

Some embodiments pertain to Example 9 that includes a method for facilitating training and deploying of pose regression in neural networks in autonomous machines, the method comprising: capturing, by an image capturing device of a computing device, one or more images of one or more objects, wherein the one or more images include one or more training images associated with a neural network; continuously estimating, in real-time, a present orientation of the computing device, wherein estimating includes continuously detecting a real-time view field as viewed by the image capturing device and based on the one or more images; and applying pose regression relating to the image capturing device using the real-time view field.

Example 10 includes the subject matter of Example 9, wherein the view field to provide at least one of translations representing global coordinates and rotations representing movements of the image capturing device along its axes, wherein applying pose regression includes adjusting the present orientation of the computing device to facilitate accurate capturing of input data and offering of output results associated with workings of the neural network.

Example 11 includes the subject matter of Example 9, further comprising: forming at least one of rotation matrix and rotation quaternion corresponding to rotation representations of the one or more images; and transitioning the rotation matrix or the rotation quaternion to decomposed angle representation using the angle estimator.

Example 12 includes the subject matter of Example 11, wherein decomposed angle representations include a plurality of angles associated with the movements of the image capturing device, wherein the plurality of angles are presented as one or more of cos(yaw), sin(yaw), cos(pitch), sin(pitch), cos(roll), and sin(roll).

Example 13 includes the subject matter of Example 9, further comprising estimating, in real-time, a difference between two consecutive rotations, wherein the difference is regarded as a prediction error.

Example 14 includes the subject matter of Example 13, further comprising applying the prediction error to the pose regression, wherein applying includes adjusting the pose regression in accordance with the prediction error.

Example 15 includes the subject matter of Example 14, further comprising dynamically estimating, in real-time, a future orientation of the computing device based on the adjustment to the pose regression.

Example 16 includes the subject matter of Example 9, wherein the input capturing device comprises at least one of one or more cameras, one or more robot eyes, one or more microphones, and one or more sensors, wherein the computing device comprises an autonomous machine or an artificially intelligent agent, wherein the autonomous machine includes at least one of one or more robots, one or more self-driving vehicles, and one or more self-operating equipment.

Some embodiments pertain to Example 17 includes a system comprising a computing device including a storage device and a processing device coupled to the storage device, the processing device to: capture, by an image capturing device of the computing device, one or more images of one or more objects, wherein the one or more images include one or more training images associated with a neural network; continuously estimate, in real-time, a present orientation of the computing device, wherein estimating includes continuously detecting a real-time view field as viewed by the image capturing device and based on the one or more images; and apply pose regression relating to the image capturing device using the real-time view field.

Example 18 includes the subject matter of Example 17, wherein the view field to provide at least one of translations representing global coordinates and rotations representing movements of the image capturing device along its axes, wherein applying pose regression includes adjusting the present orientation of the computing device to facilitate accurate capturing of input data and offering of output results associated with workings of the neural network.

Example 19 includes the subject matter of Example 17, wherein the processing device is further to: form at least one of rotation matrix and rotation quaternion corresponding to rotation representations of the one or more images; and transition the rotation matrix or the rotation quaternion to decomposed angle representation using the angle estimator.

Example 20 includes the subject matter of Example 19, wherein decomposed angle representations include a plurality of angles associated with the movements of the image capturing device, wherein the plurality of angles are presented as one or more of cos(yaw), sin(yaw), cos(pitch), sin(pitch), cos(roll), and sin(roll).

Example 21 includes the subject matter of Example 17, wherein the processing device is further to estimate, in real-time, a difference between two consecutive rotations, wherein the difference is regarded as a prediction error.

Example 22 includes the subject matter of Example 21, wherein the processing device is further to apply the prediction error to the pose regression, wherein applying includes adjusting the pose regression in accordance with the prediction error.

Example 23 includes the subject matter of Example 22, wherein the processing device is further to dynamically estimate, in real-time, a future orientation of the computing device based on the adjustment to the pose regression.

Example 24 includes the subject matter of Example 17, wherein the input capturing device comprises at least one of one or more cameras, one or more robot eyes, one or more microphones, and one or more sensors, wherein the computing device comprises an autonomous machine or an artificially intelligent agent, wherein the autonomous machine includes at least one of one or more robots, one or more self-driving vehicles, and one or more self-operating equipment.

Some embodiments pertain to Example 25 includes an apparatus comprising:

means for capturing, by an image capturing device, one or more images of one or more objects, wherein the one or more images include one or more training images associated with a neural network; means for continuously estimating, in real-time, a present orientation of the apparatus, wherein the means for estimating include means for continuously detecting a real-time view field as viewed by the image capturing device and based on the one or more images; and means for applying pose regression relating to the image capturing device using the real-time view field.

Example 26 includes the subject matter of Example 25, wherein the view field to provide at least one of translations representing global coordinates and rotations representing movements of the image capturing device along its axes, wherein the means for applying pose regression includes means for adjusting the present orientation of the apparatus to facilitate accurate capturing of input data and offering of output results associated with workings of the neural network.

Example 27 includes the subject matter of Example 25, further comprising: means for forming at least one of rotation matrix and rotation quaternion corresponding to rotation representations of the one or more images; and means for transitioning the rotation matrix or the rotation quaternion to decomposed angle representation using the angle estimator.

Example 28 includes the subject matter of Example 27, wherein decomposed angle representations include a plurality of angles associated with the movements of the image capturing device, wherein the plurality of angles are presented as one or more of cos(yaw), sin(yaw), cos(pitch), sin(pitch), cos(roll), and sin(roll).

Example 29 includes the subject matter of Example 25, further comprising means for estimating, in real-time, a difference between two consecutive rotations, wherein the difference is regarded as a prediction error.

Example 30 includes the subject matter of Example 29, further comprising means for applying the prediction error to the pose regression, wherein applying includes adjusting the pose regression in accordance with the prediction error.

Example 31 includes the subject matter of Example 30, further comprising means for dynamically estimating, in real-time, a future orientation of the apparatus based on the adjustment to the pose regression.

Example 32 includes the subject matter of Example 25, wherein the input capturing device comprises at least one of one or more cameras, one or more robot eyes, one or more microphones, and one or more sensors, wherein the apparatus comprises an autonomous machine or an artificially intelligent agent, wherein the autonomous machine includes at least one of one or more robots, one or more self-driving vehicles, and one or more self-operating equipment.

Example 33 includes at least one non-transitory or tangible machine-readable medium comprising a plurality of instructions, when executed on a computing device, to implement or perform a method as claimed in any of claims or examples 9-16.

Example 34 includes at least one machine-readable medium comprising a plurality of instructions, when executed on a computing device, to implement or perform a method as claimed in any of claims or examples 9-16.

Example 35 includes a system comprising a mechanism to implement or perform a method as claimed in any of claims or examples 9-16.

Example 36 includes an apparatus comprising means for performing a method as claimed in any of claims or examples 9-16.

Example 37 includes a computing device arranged to implement or perform a method as claimed in any of claims or examples 9-16.

Example 38 includes a communications device arranged to implement or perform a method as claimed in any of claims or examples 9-16.

Example 39 includes at least one machine-readable medium comprising a plurality of instructions, when executed on a computing device, to implement or perform a method or realize an apparatus as claimed in any preceding claims.

Example 40 includes at least one non-transitory or tangible machine-readable medium comprising a plurality of instructions, when executed on a computing device, to implement or perform a method or realize an apparatus as claimed in any preceding claims.

Example 41 includes a system comprising a mechanism to implement or perform a method or realize an apparatus as claimed in any preceding claims.

Example 42 includes an apparatus comprising means to perform a method as claimed in any preceding claims.

Example 43 includes a computing device arranged to implement or perform a method or realize an apparatus as claimed in any preceding claims.

Example 44 includes a communications device arranged to implement or perform a method or realize an apparatus as claimed in any preceding claims.

The drawings and the forgoing description give examples of embodiments. Those skilled in the art will appreciate that one or more of the described elements may well be combined into a single functional element. Alternatively, certain elements may be split into multiple functional elements. Elements from one embodiment may be added to another embodiment. For example, orders of processes described herein may be changed and are not limited to the manner described herein. Moreover, the actions of any flow diagram need not be implemented in the order shown; nor do all of the acts necessarily need to be performed. Also, those acts that are not dependent on other acts may be performed in parallel with the other acts. The scope of embodiments is by no means limited by these specific examples. Numerous variations, whether explicitly given in the specification or not, such as differences in structure, dimension, and use of material, are possible. The scope of embodiments is at least as broad as given by the following claims. 

1. An apparatus comprising: an image capturing device to capture one or more images of one or more objects, wherein the one or more images include one or more training images associated with a neural network; decomposed angle estimation and prediction logic (“estimation and prediction logic”) to continuously estimate, in real-time, a present orientation of the apparatus, wherein estimating includes continuously detecting a real-time view field as viewed by the image capturing device and based on the one or more images; and execution/forwarding logic to apply pose regression relating to the image capturing device using the real-time view field.
 2. The apparatus of claim 1, wherein the view field to provide at least one of translations representing global coordinates and rotations representing movements of the image capturing device along its axes, wherein applying pose regression includes adjusting the present orientation of the apparatus to facilitate accurate capturing of input data and offering of output results associated with workings of the neural network.
 3. The apparatus of claim 1, further comprising: formation logic to form at least one of rotation matrix and rotation quaternion corresponding to rotation representations of the one or more images; and transition logic to transition the rotation matrix or the rotation quaternion to decomposed angle representation using the angle estimator.
 4. The apparatus of claim 3, wherein decomposed angle representations include a plurality of angles associated with the movements of the image capturing device, wherein the plurality of angles are presented as one or more of cos(yaw), sin(yaw), cos(pitch), sin(pitch), cos(roll), and sin(roll).
 5. The apparatus of claim 1, wherein the estimation and prediction logic is further to estimate, in real-time, a difference between two consecutive rotations, wherein the difference is regarded as a prediction error.
 6. The apparatus of claim 5, wherein the execution/forwarding logic is further to apply the prediction error to the pose regression, wherein applying includes adjusting the pose regression in accordance with the prediction error.
 7. The apparatus of claim 6, wherein the estimation and prediction logic is further to dynamically estimate, in real-time, a future orientation of the apparatus based on the adjustment to the pose regression.
 8. The apparatus of claim 1, wherein the input capturing device comprises at least one of one or more cameras, one or more robot eyes, one or more microphones, and one or more sensors, wherein the apparatus comprises an autonomous machine or an artificially intelligent agent, wherein the autonomous machine includes at least one of one or more robots, one or more self-driving vehicles, and one or more self-operating equipment.
 9. A method comprising: capturing, by an image capturing device of a computing device, one or more images of one or more objects, wherein the one or more images include one or more training images associated with a neural network; continuously estimating, in real-time, a present orientation of the computing device, wherein estimating includes continuously detecting a real-time view field as viewed by the image capturing device and based on the one or more images; and applying pose regression relating to the image capturing device using the real-time view field.
 10. The method of claim 9, wherein the view field to provide at least one of translations representing global coordinates and rotations representing movements of the image capturing device along its axes, wherein applying pose regression includes adjusting the present orientation of the computing device to facilitate accurate capturing of input data and offering of output results associated with workings of the neural network.
 11. The method of claim 9, further comprising: forming at least one of rotation matrix and rotation quaternion corresponding to rotation representations of the one or more images; and transitioning the rotation matrix or the rotation quaternion to decomposed angle representation using the angle estimator.
 12. The method of claim 11, wherein decomposed angle representations include a plurality of angles associated with the movements of the image capturing device, wherein the plurality of angles are presented as one or more of cos(yaw), sin(yaw), cos(pitch), sin(pitch), cos(roll), and sin(roll).
 13. The method of claim 9, further comprising estimating, in real-time, a difference between two consecutive rotations, wherein the difference is regarded as a prediction error.
 14. The method of claim 13, further comprising applying the prediction error to the pose regression, wherein applying includes adjusting the pose regression in accordance with the prediction error.
 15. The method of claim 14, further comprising dynamically estimating, in real-time, a future orientation of the computing device based on the adjustment to the pose regression.
 16. The method of claim 9, wherein the input capturing device comprises at least one of one or more cameras, one or more robot eyes, one or more microphones, and one or more sensors, wherein the computing device comprises an autonomous machine or an artificially intelligent agent, wherein the autonomous machine includes at least one of one or more robots, one or more self-driving vehicles, and one or more self-operating equipment.
 17. At least one machine-readable medium comprising a plurality of instructions, executed on a computing device, to facilitate the computing device to: capture, by an image capturing device of the computing device, one or more images of one or more objects, wherein the one or more images include one or more training images associated with a neural network; continuously estimate, in real-time, a present orientation of the computing device, wherein estimating includes continuously detecting a real-time view field as viewed by the image capturing device and based on the one or more images; and apply pose regression relating to the image capturing device using the real-time view field. 18.-21. (canceled)
 22. The machine-readable medium of claim 17, wherein the view field to provide at least one of translations representing global coordinates and rotations representing movements of the image capturing device along its axes, wherein applying pose regression includes adjusting the present orientation of the computing device to facilitate accurate capturing of input data and offering of output results associated with workings of the neural network.
 23. The machine-readable medium of claim 17, wherein the computing device is further to: form at least one of rotation matrix and rotation quaternion corresponding to rotation representations of the one or more images; and transition the rotation matrix or the rotation quaternion to decomposed angle representation using the angle estimator.
 24. The machine-readable medium of claim 23, wherein decomposed angle representations include a plurality of angles associated with the movements of the image capturing device, wherein the plurality of angles are presented as one or more of cos(yaw), sin(yaw), cos(pitch), sin(pitch), cos(roll), and sin(roll).
 25. The machine-readable medium of claim 17, wherein the computing device is further to estimate, in real-time, a difference between two consecutive rotations, wherein the difference is regarded as a prediction error.
 26. The machine-readable medium of claim 25, wherein the computing device is further to apply the prediction error to the pose regression, wherein applying includes adjusting the pose regression in accordance with the prediction error.
 27. The machine-readable medium of claim 26, wherein the computing device is further to dynamically estimate, in real-time, a future orientation of the computing device based on the adjustment to the pose regression.
 28. The machine-readable medium of claim 17, wherein the input capturing device comprises at least one of one or more cameras, one or more robot eyes, one or more microphones, and one or more sensors, wherein the computing device comprises an autonomous machine or an artificially intelligent agent, wherein the autonomous machine includes at least one of one or more robots, one or more self-driving vehicles, and one or more self-operating equipment. 